Submission #1870451
Source Code Expand
#include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))
#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)
struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
const int N=100007;
struct data
{
int a,b,c;
inline bool operator<(const data&v)const
{
return a-b<v.a-v.b;
}
}s[N];
int n,x,y,z;
ll l[N],r[N];
std::priority_queue<int,std::vector<int>,std::greater<int> >q;
int main()
{
in,x,y,z;
n=x+y+z;
fo1(i,n)in,s[i].a,s[i].b,s[i].c;
std::sort(s+1,s+n+1);
ll t=0;
fo1(i,n)
{
q.push(s[i].b-s[i].c);
t+=s[i].b-s[i].c;
if(q.size()>y)t-=q.top(),q.pop();
l[i]=t;
}
while(q.size())q.pop();
t=0;
fd1(i,n)
{
q.push(s[i].a-s[i].c);
t+=s[i].a-s[i].c;
if(q.size()>x)t-=q.top(),q.pop();
r[i]=t;
}
t=-1e18;
fo1(i,n)if(i>=y&&n-i>=x)repr(t,l[i]+r[i+1]);
fo1(i,n)t+=s[i].c;
out,t,'\n';
}
Submission Info
Submission Time |
|
Task |
C - Coins |
User |
mcfx |
Language |
C++14 (GCC 5.4.1) |
Score |
800 |
Code Size |
3930 Byte |
Status |
AC |
Exec Time |
48 ms |
Memory |
3448 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 |
768 KB |
subtask_1_03.txt |
AC |
11 ms |
1152 KB |
subtask_1_04.txt |
AC |
22 ms |
1920 KB |
subtask_1_05.txt |
AC |
27 ms |
2048 KB |
subtask_1_06.txt |
AC |
36 ms |
2560 KB |
subtask_1_07.txt |
AC |
9 ms |
1024 KB |
subtask_1_08.txt |
AC |
34 ms |
2688 KB |
subtask_1_09.txt |
AC |
8 ms |
896 KB |
subtask_1_10.txt |
AC |
31 ms |
2560 KB |
subtask_1_11.txt |
AC |
44 ms |
3324 KB |
subtask_1_12.txt |
AC |
33 ms |
3324 KB |
subtask_1_13.txt |
AC |
40 ms |
3448 KB |
subtask_1_14.txt |
AC |
46 ms |
3200 KB |
subtask_1_15.txt |
AC |
47 ms |
3196 KB |
subtask_1_16.txt |
AC |
39 ms |
3320 KB |
subtask_1_17.txt |
AC |
34 ms |
3324 KB |
subtask_1_18.txt |
AC |
38 ms |
3200 KB |
subtask_1_19.txt |
AC |
43 ms |
3196 KB |
subtask_1_20.txt |
AC |
48 ms |
3324 KB |
subtask_1_21.txt |
AC |
33 ms |
3196 KB |
subtask_1_22.txt |
AC |
47 ms |
3324 KB |
subtask_1_23.txt |
AC |
42 ms |
3324 KB |
subtask_1_24.txt |
AC |
47 ms |
3196 KB |
subtask_1_25.txt |
AC |
39 ms |
3448 KB |
subtask_1_26.txt |
AC |
39 ms |
3324 KB |
subtask_1_27.txt |
AC |
38 ms |
3196 KB |
subtask_1_28.txt |
AC |
42 ms |
3196 KB |
subtask_1_29.txt |
AC |
1 ms |
256 KB |