結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | peroon |
提出日時 | 2020-05-01 04:11:59 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 823 ms / 2,000 ms |
コード長 | 6,474 bytes |
コンパイル時間 | 2,520 ms |
コンパイル使用メモリ | 183,804 KB |
実行使用メモリ | 16,356 KB |
最終ジャッジ日時 | 2023-10-14 20:26:13 |
合計ジャッジ時間 | 15,988 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 443 ms
16,116 KB |
testcase_01 | AC | 105 ms
15,600 KB |
testcase_02 | AC | 317 ms
15,296 KB |
testcase_03 | AC | 22 ms
8,672 KB |
testcase_04 | AC | 37 ms
14,220 KB |
testcase_05 | AC | 1 ms
4,348 KB |
testcase_06 | AC | 1 ms
4,348 KB |
testcase_07 | AC | 40 ms
8,964 KB |
testcase_08 | AC | 34 ms
8,700 KB |
testcase_09 | AC | 225 ms
16,356 KB |
testcase_10 | AC | 210 ms
15,284 KB |
testcase_11 | AC | 227 ms
15,368 KB |
testcase_12 | AC | 211 ms
15,540 KB |
testcase_13 | AC | 368 ms
15,352 KB |
testcase_14 | AC | 365 ms
15,444 KB |
testcase_15 | AC | 341 ms
16,132 KB |
testcase_16 | AC | 340 ms
15,224 KB |
testcase_17 | AC | 350 ms
15,452 KB |
testcase_18 | AC | 1 ms
4,352 KB |
testcase_19 | AC | 2 ms
4,352 KB |
testcase_20 | AC | 2 ms
4,352 KB |
testcase_21 | AC | 2 ms
4,352 KB |
testcase_22 | AC | 344 ms
15,484 KB |
testcase_23 | AC | 246 ms
13,912 KB |
testcase_24 | AC | 351 ms
15,048 KB |
testcase_25 | AC | 326 ms
15,068 KB |
testcase_26 | AC | 325 ms
14,536 KB |
testcase_27 | AC | 1 ms
4,352 KB |
testcase_28 | AC | 1 ms
4,348 KB |
testcase_29 | AC | 1 ms
4,352 KB |
testcase_30 | AC | 2 ms
4,348 KB |
testcase_31 | AC | 1 ms
4,348 KB |
testcase_32 | AC | 1 ms
4,352 KB |
testcase_33 | AC | 2 ms
4,352 KB |
testcase_34 | AC | 1 ms
4,352 KB |
testcase_35 | AC | 1 ms
4,352 KB |
testcase_36 | AC | 1 ms
4,348 KB |
testcase_37 | AC | 1 ms
4,352 KB |
testcase_38 | AC | 520 ms
16,216 KB |
testcase_39 | AC | 823 ms
15,888 KB |
testcase_40 | AC | 251 ms
14,032 KB |
testcase_41 | AC | 632 ms
15,424 KB |
testcase_42 | AC | 624 ms
16,332 KB |
testcase_43 | AC | 612 ms
15,324 KB |
testcase_44 | AC | 631 ms
15,696 KB |
ソースコード
#ifdef LOCAL // #define _GLIBCXX_DEBUG // #define __clock__ #else #pragma GCC optimize("Ofast") #endif #include<bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using VI = vector<ll>; using VV = vector<VI>; using VS = vector<string>; using PII = pair<ll, ll>; // tourist set template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_string(const string& s) { return '"' + s + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(bool b) { return (b ? "true" : "false"); } string to_string(vector<bool> v) { bool first = true; string res = "{"; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += ", "; } first = false; res += to_string(v[i]); } res += "}"; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ""; for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")"; } void debug_out() { cerr << '\n'; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #ifdef LOCAL #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif // tourist set end template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } #define FOR(i,a,b) for(ll i=(a);i<(b);++i) #define rep(i,b) FOR(i, 0, b) #define ALL(v) (v).begin(), (v).end() #define p(s) cout<<(s)<<'\n' #define p2(s, t) cout << (s) << " " << (t) << '\n' #define br() p("") #define pn(s) cout << (#s) << " " << (s) << '\n' #define SZ(x) ((int)(x).size()) #define SORT(A) sort(ALL(A)) #define RSORT(A) sort(ALL(A), greater<ll>()) #define MP make_pair #define p_yes() p("Yes") #define p_no() p("No") ll SUM(VI& V){ return accumulate(ALL(V), 0LL); } ll MIN(VI& V){return *min_element(ALL(V));} ll MAX(VI& V){return *max_element(ALL(V));} void print_vector(VI& V){ ll n = V.size(); rep(i, n){ if(i) cout << ' '; cout << V[i]; } cout << endl; } ll gcd(ll a,ll b){ if(b == 0) return a; return gcd(b,a%b); } ll lcm(ll a,ll b){ ll g = gcd(a,b); return a / g * b; } // long double using ld = long double; #define EPS (1e-14) #define equals(a,b) (fabs((a)-(b)) < EPS) void no(){p_no(); exit(0);} void yes(){p_yes(); exit(0);} const ll mod = 1e9 + 7; const ll inf = 1e18; const double PI = acos(-1); // bondさんのセグ木 // https://yukicoder.me/submissions/471309 template<class Monoid> struct SegTree { using Func = function<Monoid(Monoid, Monoid)>; const Func F; const Monoid UNITY; int SIZE_R; vector<Monoid> dat; SegTree(int n, const Func f, const Monoid &unity): F(f), UNITY(unity) { init(n); } void init(int n) { SIZE_R = 1; while (SIZE_R < n) SIZE_R *= 2; dat.assign(SIZE_R * 2, UNITY); } /* set, a is 0-indexed */ void set(int a, const Monoid &v) { dat[a + SIZE_R] = v; } void build() { for (int k = SIZE_R - 1; k > 0; --k) dat[k] = F(dat[k*2], dat[k*2+1]); } /* update a, a is 0-indexed */ void update(int a, const Monoid &v) { int k = a + SIZE_R; dat[k] = v; while (k >>= 1) dat[k] = F(dat[k*2], dat[k*2+1]); } /* get [a, b), a and b are 0-indexed */ Monoid get(int a, int b) { Monoid vleft = UNITY, vright = UNITY; for (int left = a + SIZE_R, right = b + SIZE_R; left < right; left >>= 1, right >>= 1) { if (left & 1) vleft = F(vleft, dat[left++]); if (right & 1) vright = F(dat[--right], vright); } return F(vleft, vright); } inline Monoid operator [] (int a) { return dat[a + SIZE_R]; } /* debug */ void print() { for (int i = 0; i < SIZE_R; ++i) { cout << (*this)[i]; if (i != SIZE_R-1) cout << ","; } cout << endl; } }; int main(){ cin.tie(0); ios::sync_with_stdio(false); // input ll N; cin>>N; VI A(N); rep(i, N) cin >> A[i]; A.push_back(1); // sentinel N++; SegTree<long long> seg(N, [](long long a, long long b) { return gcd(a, b); }, 0); rep(i,N){ seg.set(i, A[i]); } seg.build(); // exit(0); // debug(A); // debug(N); // FOR(start, 0, N){ // FOR(j, start+1, N){ // ll g = seg.get(start, j); // } // } ll left=0; ll right=0; ll sum = 0; rep(i,N-1){ // if(A[i]==1){ // sum += N-1-i; // continue; // } // にぶたんだと間に合わない! // ll left = i; // gcdが1にならない // ll right = N-1; // gcdが絶対1になる // while(left+1!=right){ // ll center = (left+right)/2; // ll g = seg.get(i, center+1); // if(g==1){ // right = center; // }else{ // left = center; // } // } // sum += N-1-right; // しゃくとり while(true){ ll g = seg.get(i, right); if(g==1){ break; }else{ right++; } } sum += N-right; } p(sum); return 0; }