結果
問題 | No.1097 Remainder Operation |
ユーザー |
![]() |
提出日時 | 2020-06-26 21:37:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 103 ms / 2,000 ms |
コード長 | 3,108 bytes |
コンパイル時間 | 2,271 ms |
コンパイル使用メモリ | 212,940 KB |
最終ジャッジ日時 | 2025-01-11 11:01:25 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;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');}}int N;int A[100000];long long K;int go[50][100000];long long val[50][100000];int main(){int i, j, t_ynMSdg;int x;long long res;rd(N);{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){rd(A[Lj4PdHRW]);}}for(i=(0);i<(N);i++){go[0][i] = (i+A[i])%N;val[0][i] = A[i];}for(j=(1);j<(50);j++){for(i=(0);i<(N);i++){go[j][i] = go[j-1][go[j-1][i]];val[j][i] = val[j-1][i] + val[j-1][go[j-1][i]];}}int KrdatlYV = rd_int();for(t_ynMSdg=(0);t_ynMSdg<(KrdatlYV);t_ynMSdg++){rd(K);x = res = 0;for(i=(0);i<(50);i++){if(K & 1LL<<i){res += val[i][x];x = go[i][x];}}wt_L(res);wt_L('\n');}return 0;}// cLay varsion 20200509-1// --- original code ---// int N, A[1d5]; ll K;// int go[50][1d5]; ll val[50][1d5];// {// int x;// ll res;// rd(N,A(N));// rep(i,N){// go[0][i] = (i+A[i])%N;// val[0][i] = A[i];// }// rep(j,1,50) rep(i,N){// go[j][i] = go[j-1][go[j-1][i]];// val[j][i] = val[j-1][i] + val[j-1][go[j-1][i]];// }// REP(rd_int()){// rd(K);// x = res = 0;// rep(i,50) if(K & 1LL<<i){// res += val[i][x];// x = go[i][x];// }// wt(res);// }// }