結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
![]() |
提出日時 | 2020-05-17 05:14:20 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 778 ms / 2,000 ms |
コード長 | 2,596 bytes |
コンパイル時間 | 1,802 ms |
コンパイル使用メモリ | 175,172 KB |
実行使用メモリ | 18,964 KB |
最終ジャッジ日時 | 2024-09-16 14:22:30 |
合計ジャッジ時間 | 12,853 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
ソースコード
#include <bits/stdc++.h>#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")using namespace std;#define lli long long int#define uli unsigned long long int#define INF 9999999999#define rep(i,m,n) for(lli i = m;i < n;i++)#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)#define pb(n) push_back(n)#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());#define Sort(n) sort(n.begin(), n.end())#define Rev(n) reverse(n.begin(),n.end())#define Out(S) cout << S << endl#define NeOut(S) cout << S#define HpOut(S) cout << setprecision(25) << S << endl#define Vec(K,L,N,S) vector<L> K(N,S)#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))#define pint pair<int,int>#define paf(L,R) pair<L,R>#define mod 998244353#define MAX 10000000#define ALL(a) a.begin(),a.end()#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))template <typename F>struct SWAG{F func;vector<long long int> left_sum;vector<long long int> right;vector<long long int> right_sum;SWAG(F f):func(f){}void push_back(long long int num) {right.push_back(num);right_sum.push_back(right_sum.size() ? func(right_sum.back(), num) : num);}void pop_back() {right.pop_back();right_sum.pop_back();}void pop_front() {if (left_sum.size()) left_sum.pop_back();else {int r0 = (right.size() + 1) / 2;if (r0 > 1) {left_sum.push_back(right[r0 - 1]);for (int i = r0 - 2; i; i--) left_sum.push_back(func(right[i], left_sum.back()));}right.erase(right.begin(), right.begin() + r0);right_sum.resize(right.size());if (right.size()) {right_sum[0] = right[0];for (int i = 1; i < (int) right.size(); i++) right_sum[i] = func(right_sum[i - 1], right[i]);}}}long long int get() {long long int cur = 0;if (left_sum.size()) cur = func(cur, left_sum.back());if (right_sum.size()) cur = func(cur, right_sum.back());return cur;}};int main(){ios::sync_with_stdio(false);cin.tie(0);lli A,B,C,D,E,F,N,M,K,L,X,Y,Z,H,W,sum=0,num=0,flag=0;string S,T;cin >> N;Vec(P,lli,N,0);rep(i,0,N)cin >> P[i];auto GCD=[](lli a,lli b){while(a){if(b>a)swap(a,b);a%=b;}return b;};SWAG<decltype(GCD)> swag(GCD);lli right=0;M=N;while(M--){while(right<N){if(swag.get()==1)break;swag.push_back(P[right]);right++;}if(swag.get()==1)sum+=N-right+1;swag.pop_front();}Out(sum);}