結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
![]() |
提出日時 | 2020-04-24 21:51:55 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 477 ms / 2,000 ms |
コード長 | 2,861 bytes |
コンパイル時間 | 3,163 ms |
コンパイル使用メモリ | 210,324 KB |
最終ジャッジ日時 | 2025-01-09 23:34:31 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
ソースコード
#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;}}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, class U> inline T GCD_L(T a, U b){T r;while(b){r=a;a=b;b=r%a;}return a;}int N;long long A[500000];int main(){int i;int j;int k;long long res = 0;long long tmp;rd(N);{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){rd(A[Lj4PdHRW]);}}for(i=(0);i<(N);i++){j = i;tmp = A[j];while(j+1 < N && tmp > 1){tmp =GCD_L(tmp, A[++j]);}if(tmp > 1){break;}k = j;tmp = A[k];while(tmp > 1){tmp =GCD_L(tmp, A[--k]);}res += (long long) (k-i+1) * (N-j);i = k;}wt_L(res);wt_L('\n');return 0;}// cLay varsion 20200419-1// --- original code ---// int N; ll A[5d5];// {// int i, j, k;// ll res = 0, tmp;// rd(N,A(N));//// rep(i,N){// j = i;// tmp = A[j];// while(j+1 < N && tmp > 1) tmp = gcd(tmp, A[++j]);// if(tmp > 1) break;//// k = j;// tmp = A[k];// while(tmp > 1) tmp = gcd(tmp, A[--k]);// res += (ll) (k-i+1) * (N-j);// i = k;// }// wt(res);// }