結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:09:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 315 ms / 2,000 ms |
コード長 | 2,543 bytes |
コンパイル時間 | 2,514 ms |
コンパイル使用メモリ | 202,228 KB |
最終ジャッジ日時 | 2025-01-09 23:54:00 |
ジャッジサーバーID (参考情報) |
judge2 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:76:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 76 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:78:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 78 | rep(i, n) scanf("%lld", &a[i]); | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))#define rep(i, n) For((i), 0, (n))#define rrep(i, n) rFor((i), (n), 0)#define fi first#define se secondusing namespace std;typedef long long lint;typedef unsigned long long ulint;typedef pair<int, int> pii;typedef pair<lint, lint> pll;template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}template<class T> T div_floor(T a, T b){if(b < 0) a *= -1, b *= -1;return a>=0 ? a/b : (a+1)/b-1;}template<class T> T div_ceil(T a, T b){if(b < 0) a *= -1, b *= -1;return a>0 ? (a-1)/b+1 : a/b;}constexpr lint mod = 1e9+7;constexpr lint INF = mod * mod;constexpr int MAX = 200010;template<typename T> struct SWAG{using P = pair<T, T>;stack<P> st_front, st_back;function<T(T, T)> f;SWAG(function<T(T, T)> f_): f(f_){}int size(){return st_front.size() + st_back.size();}bool empty(){return size() == 0;}T fold_all(){if(st_front.empty()) return st_back.top().se;if(st_back.empty()) return st_front.top().se;return f(st_front.top().se, st_back.top().se);}void push(T a){if(st_back.empty()) st_back.emplace(a, a);else st_back.emplace(a, f(st_back.top().se, a));}void pop(){if(!size()) return;if(!st_front.empty()) st_front.pop();else{while(!st_back.empty()){P tmp=st_back.top();if(st_front.empty()){st_front.emplace(tmp.fi, tmp.fi);st_back.pop();}else{st_front.emplace(tmp.fi, f(tmp.fi, st_front.top().se));st_back.pop();}}st_front.pop();}}};int main(){int n;scanf("%d", &n);lint a[n];rep(i, n) scanf("%lld", &a[i]);auto f = [](lint p, lint q){return gcd(p, q);};SWAG<lint> que(f);lint ans = 0;for(int l=0, r=1; l<n; ++l){if(que.empty()) que.push(a[l]);if(r <= l) r = l+1;while(r < n && que.fold_all() != 1){que.push(a[r]);++r;}if(r == n && que.fold_all() != 1) break;ans += n-r+1;que.pop();}printf("%lld\n", ans);}