結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:53:17 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,145 ms / 2,000 ms |
コード長 | 3,316 bytes |
コンパイル時間 | 1,656 ms |
コンパイル使用メモリ | 173,844 KB |
実行使用メモリ | 11,520 KB |
最終ジャッジ日時 | 2024-09-16 13:29:20 |
合計ジャッジ時間 | 20,270 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
ソースコード
#include <bits/stdc++.h>using namespace std;using LL = long long int;#define incID(i, l, r) for(int i = (l) ; i < (r); ++i)#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)#define incII(i, l, r) for(int i = (l) ; i <= (r); ++i)#define decII(i, l, r) for(int i = (r) ; i >= (l); --i)#define inc(i, n) incID(i, 0, n)#define dec(i, n) decID(i, 0, n)#define inc1(i, n) incII(i, 1, n)#define dec1(i, n) decII(i, 1, n)#define inID(v, l, r) ((l) <= (v) && (v) < (r))#define inII(v, l, r) ((l) <= (v) && (v) <= (r))#define PB push_back#define EB emplace_back#define MP make_pair#define FI first#define SE second#define FR front()#define BA back()#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()auto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };auto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };#define SI(v) static_cast<int>(v.size())#define RF(e, v) for(auto & e: v)#define until(e) while(! (e))#define if_not(e) if(! (e))#define ef else if#define UR assert(false)#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);void IN_() { };template<typename T, typename ... U> void IN_(T & a, U & ... b) { cin >> a; IN_(b ...); };template<typename T> void OUT(T && a) { cout << a << endl; }template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }// ---- ----template<typename T> class SegmentTree {private:int n, s;vector<T> a;function<T(T &, T &)> f;T e;bool ok;public:SegmentTree() { n = 0; }SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }void init(int nn, function<T(T &, T &)> ff, T ee) {n = nn;f = ff;e = ee;s = 1;while(s < n) { s *= 2; }a = vector<T>(2 * s, e);ok = true;}void shift(int & p) {assert(inID(p, 0, n));p += s;}void apply(int p, function<void(T &)> g) {shift(p);g(a[p]);while(p > 1) {p /= 2;a[p] = f(a[2 * p], a[2 * p + 1]);}}T fold_ID(int l, int r) {assert(ok);assert(inII(l, 0, n)); l += s;assert(inII(r, 0, n)); r += s; r--;T x = e, y = e;while(l <= r) {if(l % 2 == 1) { x = f(x, a[l]); l++; }if(r % 2 == 0) { y = f(a[r], y); r--; }l /= 2;r /= 2;}return f(x, y);}T fold_II(int l, int r) { return fold_ID(l + 0, r + 1); }T fold_CI(int l, int r) { return fold_ID(l + 1, r + 1); }T fold_CD(int l, int r) { return fold_ID(l + 1, r + 0); }const T & operator[](int p) {shift(p);return a[p];}T & ref(int p) {shift(p);ok = false;return a[p];}void update() {dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }ok = true;}};#define OP(s) [&](auto & A, auto & B) { return s; }#define AP(s) [&](auto & A) { s; }// ----template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }int main() {IN(int, n);SegmentTree<LL> st(n, gcd<LL>, 0);inc(i, n) { cin >> st.ref(i); }st.update();LL ans = 0;int p = 0;inc(i, n) {until(p == n || st.fold_II(i, p) == 1) { p++; }ans += n - p;}OUT(ans);}