Submission #1521068


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int read()
{
	int ans=0;
	char ch=getchar();
	for(;(ch<'0' || ch>'9') && ch!='-';ch=getchar());
	bool flag=0;
	if(ch=='-')flag=1,ch=getchar();
	for(;ch>='0' && ch<='9';ch=getchar())ans=ans*10+ch-'0';
	if(flag)ans=-ans;
	return ans;
}

long long rell()
{
	long long ans=0;
	char ch=getchar();
	for(;(ch<'0' || ch>'9') && ch!='-';ch=getchar());
	bool flag=0;
	if(ch=='-')flag=1,ch=getchar();
	for(;ch>='0' && ch<='9';ch=getchar())ans=ans*10ll+(long long)(ch-'0');
	if(flag)ans=-ans;
	return ans;
}

void writ(int n)
{
	char ch[25];
	int m=0;
	if(n<0)putchar('-'),n=-n;
	if(n==0)
	{
		putchar('0');
		return;
	}
	for(;n;n/=10)ch[m++]=n%10ll+'0';
	for(;m;)putchar(ch[--m]);
}

void wrll(long long n)
{
	char ch[25];
	int m=0;
	if(n<0)putchar('-'),n=-n;
	if(n==0)
	{
		putchar('0');
		return;
	}
	for(;n;n/=10ll)ch[m++]=n%10ll+'0';
	for(;m;)putchar(ch[--m]);
}
const int N=1<<20;
long long an[N];

struct node
{
	int x,y,z;

	bool friend operator < (node a,node b)
	{
		return a.x-a.y>b.x-b.y;
	}
}a[N];

int main()
{
	int x,y,z;
	scanf("%d%d%d",&x,&y,&z);
	int n=x+y+z;
	for(int i=0;i<n;i++)
	{
		scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
	}
	sort(a,a+n);
	for(int i=0;i<n;i++)
	{
		printf("%d %d %d\n",a[i].x,a[i].y,a[i].z);
	}
	static priority_queue<int> xq;
	long long ans=0;
	for(int i=0;i<x+z;i++)
	{
		xq.push(a[i].z-a[i].x);
		ans+=a[i].x;
		if(i>=x)
		{
			ans+=xq.top();
			xq.pop();
		}
		an[i]=ans;
		//printf("i=%d ans=%I64d\n",i,ans);
	}
	static priority_queue<int> yq;
	ans=0;
	long long out=0;
	for(int i=n-1;i>=x;i--)
	{
		yq.push(a[i].z-a[i].y);
		ans+=a[i].y;
		if(i<x+z)
		{
			ans+=yq.top();
			yq.pop();
		}
		out=max(out,an[i-1]+ans);
		//printf("i=%d ans=%I64d\n",i,ans);
	}
	wrll(out);
	puts("");
	return 0;
}

Submission Info

Submission Time
Task C - Coins
User bx2k
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1889 Byte
Status WA
Exec Time 70 ms
Memory 7036 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:71:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&x,&y,&z);
                          ^
./Main.cpp:75:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
                                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
WA × 3
WA × 35
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt
Case Name Status Exec Time Memory
sample_01.txt WA 2 ms 2304 KB
sample_02.txt WA 2 ms 2304 KB
sample_03.txt WA 2 ms 2304 KB
subtask_1_01.txt WA 2 ms 2304 KB
subtask_1_02.txt WA 13 ms 3072 KB
subtask_1_03.txt WA 20 ms 3584 KB
subtask_1_04.txt WA 36 ms 4608 KB
subtask_1_05.txt WA 41 ms 4992 KB
subtask_1_06.txt WA 53 ms 5760 KB
subtask_1_07.txt WA 15 ms 3200 KB
subtask_1_08.txt WA 53 ms 5248 KB
subtask_1_09.txt WA 13 ms 3072 KB
subtask_1_10.txt WA 44 ms 5120 KB
subtask_1_11.txt WA 65 ms 7036 KB
subtask_1_12.txt WA 57 ms 7036 KB
subtask_1_13.txt WA 64 ms 7036 KB
subtask_1_14.txt WA 70 ms 6656 KB
subtask_1_15.txt WA 68 ms 6908 KB
subtask_1_16.txt WA 60 ms 6288 KB
subtask_1_17.txt WA 59 ms 6016 KB
subtask_1_18.txt WA 62 ms 5760 KB
subtask_1_19.txt WA 63 ms 6016 KB
subtask_1_20.txt WA 65 ms 6912 KB
subtask_1_21.txt WA 60 ms 6784 KB
subtask_1_22.txt WA 64 ms 6908 KB
subtask_1_23.txt WA 68 ms 6784 KB
subtask_1_24.txt WA 69 ms 6908 KB
subtask_1_25.txt WA 58 ms 6276 KB
subtask_1_26.txt WA 59 ms 6268 KB
subtask_1_27.txt WA 62 ms 6016 KB
subtask_1_28.txt WA 62 ms 6016 KB
subtask_1_29.txt WA 2 ms 2304 KB