結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
![]() |
提出日時 | 2022-12-04 15:18:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,469 ms / 2,000 ms |
コード長 | 18,850 bytes |
コンパイル時間 | 3,154 ms |
コンパイル使用メモリ | 232,020 KB |
最終ジャッジ日時 | 2025-02-09 04:57:43 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
ソースコード
#line 1 "main.cpp"#define PROBLEM "https://yukicoder.me/problems/no/1036"#line 1 "library/my_template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using pi = pair<ll, ll>;using vi = vector<ll>;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))#define overload4(a, b, c, d, e, ...) e#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) \overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stolltemplate <typename T, typename U>T SUM(const vector<U> &A) {T sum = 0;for (auto &&a: A) sum += a;return sum;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())int popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T pick(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T pick(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T pick(pqg<T> &que) {assert(que.size());T a = que.top();que.pop();return a;}template <typename T>T pick(vc<T> &que) {assert(que.size());T a = que.back();que.pop_back();return a;}template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}template <typename F>ll binary_search(F check, ll ok, ll ng) {assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = S[i] - first_char; }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}template <typename CNT, typename T>vc<CNT> bincount(const vc<T> &A, int size) {vc<CNT> C(size);for (auto &&x: A) { ++C[x]; }return C;}// stabletemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(A.size());iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {int n = len(I);vc<T> B(n);FOR(i, n) B[i] = A[I[i]];return B;}#line 1 "library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace fastio {// クラスが read(), print() を持っているかを判定するメタ関数struct has_write_impl {template <class T>static auto check(T &&x) -> decltype(x.write(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) {};struct has_read_impl {template <class T>static auto check(T &&x) -> decltype(x.read(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {};struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <typename T,typename enable_if<has_read<T>::value>::type * = nullptr>inline bool read_single(T &x) {x.read();return true;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <size_t N = 0, typename T>void read_single_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);read_single(x);read_single_tuple<N + 1>(t);}}template <class... T>bool read_single(tuple<T...> &tpl) {read_single_tuple(tpl);return true;}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char &val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string &s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double &x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double &x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}template <typename T,typename enable_if<has_write<T>::value>::type * = nullptr>inline void write(T x) {x.write();}template <class T>void write(const vector<T> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> &val) {write(val.first);write(' ');write(val.second);}template <size_t N = 0, typename T>void write_tuple(const T &t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { write(' '); }const auto &x = std::get<N>(t);write(x);write_tuple<N + 1>(t);}}template <class... T>bool write(tuple<T...> &tpl) {write_tuple(tpl);return true;}template <class T, size_t S>void write(const array<T, S> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if (val < 0) {negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if (negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}} // namespace fastiousing fastio::print;using fastio::flush;using fastio::read;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 2 "library/ds/segtree/dynamic_segtree.hpp"template <typename Monoid, bool PERSISTENT, int NODES>struct Dynamic_SegTree {using MX = Monoid;using X = typename MX::value_type;using F = function<X(ll, ll)>;F default_prod;struct Node {Node *l, *r;X x;};const ll L0, R0;Node *pool;int pid;using np = Node *;Dynamic_SegTree(ll L0, ll R0, F default_prod = [](ll l, ll r) -> X { return MX::unit(); }): default_prod(default_prod), L0(L0), R0(R0), pid(0) {pool = new Node[NODES];}np new_node(const X x) {pool[pid].l = pool[pid].r = nullptr;pool[pid].x = x;return &(pool[pid++]);}np new_node(ll l, ll r) { return new_node(default_prod(l, r)); }np new_node(const vc<X> &dat) {assert(L0 == 0 && R0 == len(dat));auto dfs = [&](auto &dfs, ll l, ll r) -> Node * {if (l == r) return nullptr;if (r == l + 1) return new_node(dat[l]);ll m = (l + r) / 2;np l_root = dfs(dfs, l, m), r_root = dfs(dfs, m, r);X x = MX::op(l_root->x, r_root->x);np root = new_node(x);root->l = l_root, root->r = r_root;return root;};return dfs(dfs, 0, len(dat));}X prod(np root, ll l, ll r) {assert(L0 <= l && l < r && r <= R0);X x = MX::unit();prod_rec(root, L0, R0, l, r, x);return x;}np set(np root, ll i, const X &x) {assert(L0 <= i && i < R0);return set_rec(root, L0, R0, i, x);}np multiply(np root, ll i, const X &x) {assert(L0 <= i && i < R0);return multiply_rec(root, L0, R0, i, x);}template <typename F>ll max_right(np root, F check, ll L) {assert(L0 <= L && L <= R0 && check(MX::unit()));X x = MX::unit();return max_right_rec(root, check, L0, R0, L, x);}template <typename F>ll min_left(np root, F check, ll R) {assert(L0 <= R && R <= R0 && check(MX::unit()));X x = MX::unit();return min_left_rec(root, check, L0, R0, R, x);}vc<X> get_all(np root) {vc<X> res;res.reserve(R0 - L0);auto dfs = [&](auto &dfs, np c, ll l, ll r) -> void {if (!c) c = new_node(l, r);if (r - l == 1) {res.eb(c->x);return;}ll m = (l + r) / 2;dfs(dfs, c->l, l, m);dfs(dfs, c->r, m, r);};dfs(dfs, root, L0, R0);return res;}void reset() { pid = 0; }private:np copy_node(np c) {if (!c || !PERSISTENT) return c;pool[pid].l = c->l, pool[pid].r = c->r;pool[pid].x = c->x;return &(pool[pid++]);}np set_rec(np c, ll l, ll r, ll i, const X &x) {if (r == l + 1) {c = copy_node(c);c->x = x;return c;}ll m = (l + r) / 2;c = copy_node(c);if (i < m) {if (!c->l) c->l = new_node(l, m);c->l = set_rec(c->l, l, m, i, x);} else {if (!c->r) c->r = new_node(m, r);c->r = set_rec(c->r, m, r, i, x);}X xl = (c->l ? c->l->x : default_prod(l, m));X xr = (c->r ? c->r->x : default_prod(m, r));c->x = MX::op(xl, xr);return c;}np multiply_rec(np c, ll l, ll r, ll i, const X &x) {if (r == l + 1) {c = copy_node(c);c->x = MX::op(c->x, x);return c;}ll m = (l + r) / 2;c = copy_node(c);if (i < m) {if (!c->l) c->l = new_node(l, m);c->l = multiply_rec(c->l, l, m, i, x);} else {if (!c->r) c->r = new_node(m, r);c->r = multiply_rec(c->r, m, r, i, x);}X xl = (c->l ? c->l->x : default_prod(l, m));X xr = (c->r ? c->r->x : default_prod(m, r));c->x = MX::op(xl, xr);return c;}void prod_rec(np c, ll l, ll r, ll ql, ll qr, X &x) {chmax(ql, l);chmin(qr, r);if (ql >= qr) return;if (!c) {x = MX::op(x, default_prod(ql, qr));return;}if (l == ql && r == qr) {x = MX::op(x, c->x);return;}ll m = (l + r) / 2;prod_rec(c->l, l, m, ql, qr, x);prod_rec(c->r, m, r, ql, qr, x);}template <typename F>ll max_right_rec(np c, const F &check, ll l, ll r, ll ql, X &x) {if (r <= ql) return R0;if (ql <= l && check(MX::op(x, c->x))) {x = MX::op(x, c->x);return R0;}if (r == l + 1) return l;ll m = (l + r) / 2;if (!c->l) c->l = new_node(l, m);ll k = max_right_rec(c->l, check, l, m, ql, x);if (k != R0) return k;if (!c->r) c->r = new_node(m, r);return max_right_rec(c->r, check, m, r, ql, x);}template <typename F>ll min_left_rec(np c, const F &check, ll l, ll r, ll qr, X &x) {if (qr <= l) return L0;if (r <= qr && check(MX::op(c->x, x))) {x = MX::op(x, c->x);return L0;}if (r == l + 1) return r;ll m = (l + r) / 2;if (!c->r) c->r = new_node(m, r);ll k = min_left_rec(c->r, check, m, r, qr, x);if (k != L0) return k;if (!c->l) c->l = new_node(l, m);return min_left_rec(c->l, check, l, m, qr, x);}};#line 2 "library/alg/monoid/gcd.hpp"template <typename X>struct Monoid_Gcd {using value_type = X;static X op(X x, X y) { return gcd(x, y); }static constexpr X unit() { return 0; }static constexpr bool commute = true;};#line 6 "main.cpp"void solve() {LL(N);VEC(ll, A, N);auto f = [&](ll L, ll R) -> ll { return 0; };Dynamic_SegTree<Monoid_Gcd<ll>, false, 1'000'000> seg(0, N, f);auto root = seg.new_node(A);ll ANS1 = 0;FOR(L, N) {auto check = [&](auto e) -> bool { return e != 1; };auto R = seg.max_right(root, check, L);ANS1 += N - R;}ll ANS2 = 0;FOR(R, 1, N + 1) {auto check = [&](auto e) -> bool { return e != 1; };auto L = seg.min_left(root, check, R);ANS2 += L;}assert(ANS1 == ANS2);print(ANS1);}signed main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << setprecision(15);ll T = 1;// LL(T);FOR(_, T) solve();return 0;}