結果
問題 | No.1034 テスターのふっぴーさん |
ユーザー |
![]() |
提出日時 | 2020-04-24 21:26:05 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,069 bytes |
コンパイル時間 | 2,630 ms |
コンパイル使用メモリ | 211,560 KB |
最終ジャッジ日時 | 2025-01-09 23:10:53 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#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(int &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;}}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;}}inline int rd_int(void){int x;rd(x);return 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 T> inline T pow2_L(T a){return a*a;}long long N;long long I;long long J;int main(){int Lj4PdHRW;int KL2GvlyY = rd_int();for(Lj4PdHRW=(0);Lj4PdHRW<(KL2GvlyY);Lj4PdHRW++){long long res = 0;long long k;rd(N);rd(I);rd(J);k =min_L(min_L(min_L(I, J), N-1-I), N-1-J);res +=(pow2_L(N))-(pow2_L((N-2*k)));N -= 2*k;{auto RZTsC2BF = (k);I -= RZTsC2BF;J -= RZTsC2BF;}if(I==0){res += J;}else if(J==N-1){res += N-1 + I;}else if(I==N-1){res += 2*(N-1) + (N-1-J);}else{res += 3*(N-1) + (N-1-I);}wt_L(res);wt_L('\n');}return 0;}// cLay varsion 20200419-1// --- original code ---// ll N, I, J;// {// REP(rd_int()){// ll res = 0, k;// rd(N,I,J);// k = min(I, J, N-1-I, N-1-J);// res += N ** 2 - (N-2*k) ** 2;// N -= 2k;// (I, J) -= k;// if(I==0){// res += J;// } else if(J==N-1) {// res += N-1 + I;// } else if(I==N-1) {// res += 2(N-1) + (N-1-J);// } else {// res += 3(N-1) + (N-1-I);// }// wt(res);// }// }