Submission #1870995
Source Code Expand
#include<cstdio> #include<algorithm> #include<queue> using namespace std; inline int read() { int x;char c; while((c=getchar())<'0'||c>'9'); for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=x*10+c-'0'; return x; } #define MN 100000 struct coin{int x,y;}c[MN+5]; bool cmp(const coin&a,const coin&b){return a.x>b.x;} struct CMP1{bool operator()(int a,int b){return c[a].y-c[a].x<c[b].y-c[b].x;}}; struct CMP2{bool operator()(int a,int b){return c[a].y<c[b].y;}}; priority_queue<int,vector<int>,CMP1> pq1; priority_queue<int,vector<int>,CMP2> pq2; long long ans,mx=-1e18,s1[MN+5],s2; int main() { int x,y,z,i,v; x=read();y=read();z=read(); for(i=1;i<=x+y+z;++i)ans+=v=read(),c[i].x=read()-v,c[i].y=read()-v; sort(c+1,c+x+y+z+1,cmp); for(i=1;i<=y+z;++i) { s1[i]=s1[i-1]+c[i].x;pq1.push(i); if(i>y)v=pq1.top(),pq1.pop(),s1[i]+=c[v].y-c[v].x; } for(i=x+y+z;i>y;--i) { pq2.push(i); if(i<=y+z)s2+=c[pq2.top()].y,pq2.pop(); if(i-1<=y+z)mx=max(mx,s1[i-1]+s2); } printf("%lld",ans+mx); }
Submission Info
Submission Time | |
---|---|
Task | C - Coins |
User | ditoly |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1031 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 2296 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 8 ms | 512 KB |
subtask_1_03.txt | AC | 12 ms | 768 KB |
subtask_1_04.txt | AC | 23 ms | 1152 KB |
subtask_1_05.txt | AC | 28 ms | 1280 KB |
subtask_1_06.txt | AC | 35 ms | 1536 KB |
subtask_1_07.txt | AC | 8 ms | 640 KB |
subtask_1_08.txt | AC | 38 ms | 1708 KB |
subtask_1_09.txt | AC | 8 ms | 640 KB |
subtask_1_10.txt | AC | 27 ms | 1536 KB |
subtask_1_11.txt | AC | 42 ms | 1916 KB |
subtask_1_12.txt | AC | 29 ms | 1916 KB |
subtask_1_13.txt | AC | 38 ms | 1808 KB |
subtask_1_14.txt | AC | 50 ms | 1920 KB |
subtask_1_15.txt | AC | 46 ms | 2044 KB |
subtask_1_16.txt | AC | 37 ms | 2172 KB |
subtask_1_17.txt | AC | 40 ms | 1792 KB |
subtask_1_18.txt | AC | 46 ms | 1920 KB |
subtask_1_19.txt | AC | 47 ms | 2044 KB |
subtask_1_20.txt | AC | 40 ms | 2044 KB |
subtask_1_21.txt | AC | 36 ms | 1920 KB |
subtask_1_22.txt | AC | 37 ms | 2044 KB |
subtask_1_23.txt | AC | 45 ms | 1672 KB |
subtask_1_24.txt | AC | 46 ms | 2044 KB |
subtask_1_25.txt | AC | 32 ms | 2296 KB |
subtask_1_26.txt | AC | 35 ms | 1984 KB |
subtask_1_27.txt | AC | 44 ms | 1920 KB |
subtask_1_28.txt | AC | 46 ms | 1916 KB |
subtask_1_29.txt | AC | 1 ms | 256 KB |