結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | minato |
提出日時 | 2020-08-11 17:58:51 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 286 ms / 2,000 ms |
コード長 | 2,744 bytes |
コンパイル時間 | 4,860 ms |
コンパイル使用メモリ | 239,468 KB |
実行使用メモリ | 28,632 KB |
最終ジャッジ日時 | 2023-10-14 20:36:16 |
合計ジャッジ時間 | 13,697 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
8,284 KB |
testcase_01 | AC | 113 ms
6,856 KB |
testcase_02 | AC | 121 ms
28,200 KB |
testcase_03 | AC | 13 ms
4,724 KB |
testcase_04 | AC | 23 ms
5,608 KB |
testcase_05 | AC | 1 ms
4,368 KB |
testcase_06 | AC | 1 ms
4,368 KB |
testcase_07 | AC | 39 ms
4,684 KB |
testcase_08 | AC | 32 ms
4,372 KB |
testcase_09 | AC | 168 ms
6,908 KB |
testcase_10 | AC | 156 ms
6,592 KB |
testcase_11 | AC | 172 ms
6,876 KB |
testcase_12 | AC | 157 ms
6,716 KB |
testcase_13 | AC | 281 ms
6,644 KB |
testcase_14 | AC | 286 ms
7,012 KB |
testcase_15 | AC | 267 ms
6,648 KB |
testcase_16 | AC | 270 ms
6,724 KB |
testcase_17 | AC | 277 ms
6,648 KB |
testcase_18 | AC | 2 ms
4,368 KB |
testcase_19 | AC | 2 ms
4,368 KB |
testcase_20 | AC | 2 ms
4,372 KB |
testcase_21 | AC | 2 ms
4,368 KB |
testcase_22 | AC | 263 ms
6,324 KB |
testcase_23 | AC | 195 ms
5,692 KB |
testcase_24 | AC | 275 ms
6,648 KB |
testcase_25 | AC | 250 ms
6,416 KB |
testcase_26 | AC | 260 ms
6,460 KB |
testcase_27 | AC | 2 ms
4,372 KB |
testcase_28 | AC | 1 ms
4,368 KB |
testcase_29 | AC | 1 ms
4,368 KB |
testcase_30 | AC | 1 ms
4,368 KB |
testcase_31 | AC | 1 ms
4,372 KB |
testcase_32 | AC | 1 ms
4,368 KB |
testcase_33 | AC | 2 ms
4,372 KB |
testcase_34 | AC | 1 ms
4,368 KB |
testcase_35 | AC | 1 ms
4,372 KB |
testcase_36 | AC | 1 ms
4,368 KB |
testcase_37 | AC | 1 ms
4,368 KB |
testcase_38 | AC | 117 ms
28,632 KB |
testcase_39 | AC | 150 ms
6,872 KB |
testcase_40 | AC | 194 ms
5,624 KB |
testcase_41 | AC | 179 ms
6,952 KB |
testcase_42 | AC | 178 ms
6,884 KB |
testcase_43 | AC | 172 ms
9,596 KB |
testcase_44 | AC | 176 ms
8,204 KB |
ソースコード
#pragma GCC optimize("Ofast") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; using ll = long long; using u64 = uint_fast64_t; using pii = pair<int, int>; using pll = pair<long long, long long>; #define rep(i, n) for(int i = 0; i < (n); ++i) #define all(x) (x).begin(),(x).end() constexpr char ln = '\n'; constexpr long long MOD = 1000000007; //constexpr long long MOD = 998244353; template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; } template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; } inline int popcount(int x) {return __builtin_popcount(x);} inline int popcount(long long x) {return __builtin_popcountll(x);} void print() { cout << "\n"; } template<class T, class... Args> void print(const T &x, const Args &... args) { cout << x << " "; print(args...); } /////////////////////////////////////////////////////////////////////////////////////////////////////////////// template<typename T, typename Monoid> struct SlidingWindowAggregation { Monoid merge; T unity; vector<pair<T, T>> front, back; SlidingWindowAggregation(Monoid f, T id) : merge(f), unity(id) {} bool empty() const {return front.empty() and back.empty();} int size() const {return front.size() + back.size();} T fold_all() const { T vf = front.empty() ? unity : front.back().second; T vb = back.empty() ? unity : back.back().second; return merge(vf,vb); } void emplace(const T &val) { if (back.empty()) { back.emplace_back(val,val); } else { back.emplace_back(val,merge(back.back().second,val)); } } void pop() { assert(!empty()); if (front.empty()) { front.emplace_back(back.back().first,back.back().first); back.pop_back(); while (!back.empty()) { front.emplace_back(back.back().first,merge(back.back().first,front.back().second)); back.pop_back(); } } front.pop_back(); } }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll N; cin >> N; vector<ll> A(N); rep(i,N) cin >> A[i]; auto f=[](ll a, ll b) {return gcd(a,b);}; const ll id = 0; SlidingWindowAggregation SWAG(f,id); ll ans = N*(N+1)/2; for (int l = 0, r = 0; l < N; l++) { if (r < l) r = l; while (r < N and f(SWAG.fold_all(),A[r]) != 1) { SWAG.emplace(A[r++]); } ans -= r-l; if (!SWAG.empty()) SWAG.pop(); } cout << ans << ln; }