結果
問題 | No.1122 Plane Tickets |
ユーザー |
![]() |
提出日時 | 2020-07-22 22:03:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,593 bytes |
コンパイル時間 | 3,549 ms |
コンパイル使用メモリ | 211,092 KB |
最終ジャッジ日時 | 2025-01-12 02:45:52 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 42 WA * 13 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;template<class S, class T> inline S min_L(S a,T b){return a<=b?a:b;}inline int my_getchar_unlocked(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread_unlocked(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(long long &x){int k;int m=0;x=0;for(;;){k = my_getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite_unlocked(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar_unlocked(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar_unlocked(a);}inline void wt_L(long long x){int s=0;int m=0;char f[20];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar_unlocked('-');}while(s--){my_putchar_unlocked(f[s]+'0');}}template<class S, class T> inline S chmax(S &a, T b){if(a<b){a=b;}return a;}long long A[5];long long x[5];int main(){long long i;long long j;long long k;long long res = 0;long long tmp;{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(5);Lj4PdHRW++){rd(A[Lj4PdHRW]);}}for(k=(0);k<(5);k++){for(i=(0);i<(5);i++){x[i] = A[(i+k)%5];}tmp = 0;for(i=(0);i<(5);i++){j =min_L(min_L(x[i], x[(i+1)%5]), x[(i+2)%5]);tmp += j;{auto KrdatlYV = (j);x[i] -= KrdatlYV;x[(i+1)%5] -= KrdatlYV;x[(i+2)%5] -= KrdatlYV;}}chmax(res, tmp);}wt_L(res);wt_L('\n');return 0;}// cLay varsion 20200509-1// --- original code ---// ll A[5], x[5];// {// ll i, j, k, res = 0, tmp;// rd(A(5));// rep(k,5){// rep(i,5) x[i] = A[(i+k)%5];// tmp = 0;// rep(i,5){// j = min(x[i], x[(i+1)%5], x[(i+2)%5]);// tmp += j;// (x[i], x[(i+1)%5], x[(i+2)%5]) -= j;// }// res >?= tmp;// }// wt(res);// }