結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
|
提出日時 | 2020-04-24 21:44:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,011 ms / 2,000 ms |
コード長 | 3,456 bytes |
コンパイル時間 | 1,889 ms |
コンパイル使用メモリ | 129,988 KB |
最終ジャッジ日時 | 2025-01-09 23:25:38 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:130:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 130 | ll N; scanf("%lld", &N); | ~~~~~^~~~~~~~~~~~ main.cpp:131:59: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 131 | vector<ll> a(N); for (int i = 0; i < N; i++) scanf("%lld", &a[i]); | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <cstdio>#include <iostream>#include <string>#include <sstream>#include <stack>#include <algorithm>#include <cmath>#include <queue>#include <map>#include <set>#include <cstdlib>#include <bitset>#include <tuple>#include <assert.h>#include <deque>#include <bitset>#include <iomanip>#include <limits>#include <chrono>#include <random>#include <array>#include <unordered_map>#include <functional>#include <complex>#include <numeric>template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }constexpr long long MAX = 5100000;constexpr long long INF = 1LL << 60;constexpr int inf = 1000000007;constexpr long long mod = 1000000007LL;//constexpr long long mod = 998244353LL;using namespace std;typedef unsigned long long ull;typedef long long ll;template< typename Monoid >struct SegmentTree {using F = function< Monoid(Monoid, Monoid) >;int sz;vector< Monoid > seg;const F f;const Monoid M1;SegmentTree(int n, const F f, const Monoid& M1) : f(f), M1(M1) {sz = 1;while (sz < n) sz <<= 1;seg.assign(2 * sz, M1);}void set(int k, const Monoid& x) {seg[k + sz] = x;}void build() {for (int k = sz - 1; k > 0; k--) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}void update(int k, const Monoid& x) {k += sz;seg[k] = x;while (k >>= 1) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}Monoid query(int a, int b) {Monoid L = M1, R = M1;if (a >= b) return M1;for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if (a & 1) L = f(L, seg[a++]);if (b & 1) R = f(seg[--b], R);}return f(L, R);}template< typename C >int find_subtree(int a, const C& check, Monoid& M, bool type) {while (a < sz) {Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);if (check(nxt)) a = 2 * a + type;else M = nxt, a = 2 * a + 1 - type;}return a - sz;}template< typename C >int find_first(int a, const C& check) {Monoid L = M1;if (a <= 0) {if (check(f(L, seg[1]))) return find_subtree(1, check, L, false);return -1;}int b = sz;for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if (a & 1) {Monoid nxt = f(L, seg[a]);if (check(nxt)) return find_subtree(a, check, L, false);L = nxt;++a;}}return -1;}};ll f(ll a, ll b) {return gcd(a, b);}bool C(ll a) {return a == 1;}int main(){/*cin.tie(nullptr);ios::sync_with_stdio(false);*/ll N; scanf("%lld", &N);vector<ll> a(N); for (int i = 0; i < N; i++) scanf("%lld", &a[i]);SegmentTree<ll> seg(N, f, 0);for (int i = 0; i < N; i++) seg.set(i, a[i]);seg.build();ll res = 0;for (int i = 0; i < N; i++) {if (a[i] == 1) {res += N - i;continue;}if (seg.query(i, N) != 1) break;ll right = seg.find_first(i, C);res += N - right;//cout << res << endl;}cout << res << endl;return 0;}