結果

問題 No.1036 Make One With GCD 2
ユーザー iiljjiiljj
提出日時 2020-04-25 19:21:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 312 ms / 2,000 ms
コード長 6,947 bytes
コンパイル時間 2,391 ms
コンパイル使用メモリ 212,356 KB
実行使用メモリ 85,248 KB
最終ジャッジ日時 2024-09-16 13:54:19
合計ジャッジ時間 12,120 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 281 ms
85,120 KB
testcase_01 AC 212 ms
85,120 KB
testcase_02 AC 190 ms
85,120 KB
testcase_03 AC 49 ms
32,000 KB
testcase_04 AC 88 ms
56,448 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 82 ms
36,480 KB
testcase_08 AC 68 ms
30,336 KB
testcase_09 AC 235 ms
83,456 KB
testcase_10 AC 207 ms
77,824 KB
testcase_11 AC 229 ms
84,864 KB
testcase_12 AC 217 ms
78,336 KB
testcase_13 AC 312 ms
81,280 KB
testcase_14 AC 305 ms
82,176 KB
testcase_15 AC 297 ms
77,312 KB
testcase_16 AC 309 ms
77,952 KB
testcase_17 AC 299 ms
80,128 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 3 ms
5,376 KB
testcase_22 AC 292 ms
76,288 KB
testcase_23 AC 222 ms
56,960 KB
testcase_24 AC 297 ms
79,360 KB
testcase_25 AC 267 ms
72,576 KB
testcase_26 AC 272 ms
75,136 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 1 ms
5,376 KB
testcase_31 AC 1 ms
5,376 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 1 ms
5,376 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 182 ms
85,248 KB
testcase_39 AC 280 ms
85,120 KB
testcase_40 AC 208 ms
56,832 KB
testcase_41 AC 265 ms
85,120 KB
testcase_42 AC 262 ms
85,248 KB
testcase_43 AC 262 ms
85,248 KB
testcase_44 AC 267 ms
85,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }

/* #endregion */

/* #region SparseTable */

template <typename T> struct SparseTable {
    using F = function<T(T, T)>;
    vc<vc<T>> dat;
    vc<int> ht;
    const F f;

    SparseTable() {}
    SparseTable(F f) : f(f) {}

    void build(const vc<T> &v) {
        ll n = SIZE(v), h = 1;
        while ((1 << h) <= n) h++;
        dat.assign(h, vc<T>(n));
        ht.assign(n + 1, 0);
        REPM(j, 2, n) ht[j] = ht[j >> 1] + 1;

        REP(j, 0, n) dat[0][j] = v[j];
        for (int i = 1, p = 1; i < h; i++, p <<= 1)
            REP(j, 0, n) dat[i][j] = f(dat[i - 1][j], dat[i - 1][min(j + p, n - 1)]);
    };

    // 半開区間 [a, b) に対するクエリを実行する
    T query(int a, int b) {
        int l = b - a;
        return f(dat[ht[l]][a], dat[ht[l]][b - (1 << ht[l])]);
    }
};

/* #endregion */

// Problem
void solve() {
    ll n;
    cin >> n;
    vll a(n);
    cin >> a;

    auto f = [](ll a, ll b) { return gcd(a, b); };
    SparseTable<ll> tbl(f); // gcd の単位元は 0
    tbl.build(a);

    ll ret = 0;
    auto check = [](ll acc) { return acc == 1; };
    ll right = 0;
    REP(left, 0, n) {
        chmax(right, left);
        while (right < n) {
            if (tbl.query(left, right + 1) == 1) break;
            right++;
        }
        // if (right == -1) break;
        if (right == n) break;
        ret += n - right;
    }
    cout << ret << endl;
}

// entry point
int main() {
    solve();
    return 0;
}
0