結果

問題 No.1261 数字集め
ユーザー simasima_71simasima_71
提出日時 2020-10-16 23:26:25
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,085 ms / 8,000 ms
コード長 7,539 bytes
コンパイル時間 1,481 ms
コンパイル使用メモリ 135,256 KB
実行使用メモリ 35,072 KB
最終ジャッジ日時 2024-07-21 04:36:08
合計ジャッジ時間 37,257 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,085 ms
35,072 KB
testcase_01 AC 104 ms
14,080 KB
testcase_02 AC 219 ms
25,728 KB
testcase_03 AC 225 ms
25,984 KB
testcase_04 AC 143 ms
18,048 KB
testcase_05 AC 295 ms
33,152 KB
testcase_06 AC 171 ms
20,096 KB
testcase_07 AC 230 ms
26,880 KB
testcase_08 AC 139 ms
16,512 KB
testcase_09 AC 180 ms
20,480 KB
testcase_10 AC 12 ms
5,376 KB
testcase_11 AC 286 ms
32,768 KB
testcase_12 AC 290 ms
29,696 KB
testcase_13 AC 243 ms
27,136 KB
testcase_14 AC 32 ms
6,016 KB
testcase_15 AC 135 ms
15,104 KB
testcase_16 AC 237 ms
26,880 KB
testcase_17 AC 206 ms
22,400 KB
testcase_18 AC 138 ms
15,360 KB
testcase_19 AC 219 ms
26,112 KB
testcase_20 AC 35 ms
6,656 KB
testcase_21 AC 295 ms
34,560 KB
testcase_22 AC 294 ms
34,432 KB
testcase_23 AC 293 ms
34,560 KB
testcase_24 AC 321 ms
34,432 KB
testcase_25 AC 372 ms
34,432 KB
testcase_26 AC 322 ms
34,432 KB
testcase_27 AC 324 ms
34,432 KB
testcase_28 AC 374 ms
34,560 KB
testcase_29 AC 320 ms
34,432 KB
testcase_30 AC 324 ms
34,432 KB
testcase_31 AC 326 ms
34,432 KB
testcase_32 AC 323 ms
34,432 KB
testcase_33 AC 321 ms
34,432 KB
testcase_34 AC 324 ms
34,432 KB
testcase_35 AC 321 ms
34,560 KB
testcase_36 AC 329 ms
34,432 KB
testcase_37 AC 329 ms
34,432 KB
testcase_38 AC 323 ms
34,432 KB
testcase_39 AC 327 ms
34,432 KB
testcase_40 AC 325 ms
34,432 KB
testcase_41 AC 321 ms
34,560 KB
testcase_42 AC 323 ms
34,560 KB
testcase_43 AC 320 ms
34,432 KB
testcase_44 AC 351 ms
30,976 KB
testcase_45 AC 191 ms
9,856 KB
testcase_46 AC 168 ms
18,560 KB
testcase_47 AC 222 ms
14,208 KB
testcase_48 AC 288 ms
26,624 KB
testcase_49 AC 331 ms
30,720 KB
testcase_50 AC 402 ms
27,904 KB
testcase_51 AC 86 ms
10,496 KB
testcase_52 AC 38 ms
5,376 KB
testcase_53 AC 138 ms
10,624 KB
testcase_54 AC 211 ms
11,648 KB
testcase_55 AC 89 ms
7,424 KB
testcase_56 AC 192 ms
8,576 KB
testcase_57 AC 314 ms
25,344 KB
testcase_58 AC 156 ms
9,856 KB
testcase_59 AC 462 ms
31,616 KB
testcase_60 AC 150 ms
11,392 KB
testcase_61 AC 163 ms
14,464 KB
testcase_62 AC 453 ms
28,928 KB
testcase_63 AC 61 ms
7,680 KB
testcase_64 AC 443 ms
33,664 KB
testcase_65 AC 238 ms
23,552 KB
testcase_66 AC 182 ms
20,096 KB
testcase_67 AC 260 ms
28,672 KB
testcase_68 AC 189 ms
19,200 KB
testcase_69 AC 161 ms
18,944 KB
testcase_70 AC 225 ms
15,872 KB
testcase_71 AC 360 ms
27,648 KB
testcase_72 AC 231 ms
12,288 KB
testcase_73 AC 196 ms
13,824 KB
testcase_74 AC 94 ms
8,448 KB
testcase_75 AC 256 ms
18,176 KB
testcase_76 AC 259 ms
25,472 KB
testcase_77 AC 290 ms
29,184 KB
testcase_78 AC 37 ms
5,376 KB
testcase_79 AC 373 ms
29,952 KB
testcase_80 AC 81 ms
5,376 KB
testcase_81 AC 78 ms
6,272 KB
testcase_82 AC 283 ms
24,320 KB
testcase_83 AC 210 ms
12,928 KB
testcase_84 AC 556 ms
34,816 KB
testcase_85 AC 543 ms
34,816 KB
testcase_86 AC 496 ms
34,944 KB
testcase_87 AC 480 ms
34,816 KB
testcase_88 AC 492 ms
34,816 KB
testcase_89 AC 483 ms
34,944 KB
testcase_90 AC 485 ms
34,816 KB
testcase_91 AC 538 ms
34,816 KB
testcase_92 AC 565 ms
34,816 KB
testcase_93 AC 482 ms
34,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <fstream>
#include <cmath>
#include <limits>
#include <chrono>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
#include <cassert>
#pragma warning (disable: 4996)
using namespace std;

using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

struct UnionFind {
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    if (n < 0)return 0;
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

ll merge_cnt(vector<ll>& a) {
    int n = a.size();
    if (n <= 1) { return 0; }

    ll cnt = 0;
    vector<ll> b(a.begin(), a.begin() + n / 2);
    vector<ll> c(a.begin() + n / 2, a.end());

    cnt += merge_cnt(b);
    cnt += merge_cnt(c);

    int ai = 0, bi = 0, ci = 0;
    while (ai < n) {
        if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {
            a[ai++] = b[bi++];
        }
        else {
            cnt += n / 2 - bi;
            a[ai++] = c[ci++];
        }
    }
    return cnt;
}

struct edge { ll to, cost; };
typedef pair<ll, ll> P;
struct graph {
    ll V;
    vector<vector<edge> > G;
    vector<ll> d;

    graph(ll n) {
        init(n);
    }

    void init(ll n) {
        V = n;
        G.resize(V);
        d.resize(V);
        for (int i = 0; i < V; i++) {
            d[i] = 2000000000000000000;
        }
    }

    void add_edge(ll s, ll t, ll cost) {
        edge e;
        e.to = t, e.cost = cost;
        G[s].push_back(e);
    }

    void dijkstra(ll s) {
        for (int i = 0; i < V; i++) {
            d[i] = 2000000000000000000;
        }
        d[s] = 0;
        priority_queue<P, vector<P>, greater<P> > que;
        que.push(P(0, s));
        while (!que.empty()) {
            P p = que.top(); que.pop();
            ll v = p.second;
            if (d[v] < p.first) continue;
            for (auto e : G[v]) {
                if (d[e.to] > d[v] + e.cost) {
                    d[e.to] = d[v] + e.cost;
                    que.push(P(d[e.to], e.to));
                }
            }
        }
    }
};



int main() {
    ll n,m;
    cin >> n >> m;
    m -= 3;
    vector<ll> z(n+1);
    for (int i = 0; i < n-1; i++) {
        cin >> z[i + 2];
        z[i + 2]--;
    }
    ll ans = 0;
    for (int i = 2; i < n; i++) {
        if (n % i != 0)continue;
        for (int j = 2; j < n/i; j++) {
            if (n % (i*j) != 0)continue;
            vector<ll> x(3);
            x[0] = z[n];
            x[1] = z[j*i];
            x[2] = z[i];
            sort(x.begin(), x.end());
            ll f = (modpow(x[2], m + 1, 1000000007) - modpow(x[1], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[1], 1000000007) % 1000000007 * x[1] % 1000000007;
            ll g= (modpow(x[2], m + 1, 1000000007) - modpow(x[0], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[0], 1000000007) % 1000000007 * x[0] % 1000000007;
            ans+=(f-g+1000000007) * modinv(x[1] - x[0], 1000000007) % 1000000007;
        }
    }
    ans %= 1000000007;
    ll q;
    cin >> q;
    set<ll> f;
    vector<vector<int>> d(n+1);
    for (int i = 0; i < q; i++) {
        cout << ans << endl;
        ll a, b;
        cin >> a >> b;
        d[b].push_back(a);
        if (b == n) {
            f.insert(a);
            for (int i = 2; i <= sqrt(a); i++) {
                if (a % i != 0)continue;
                if (i != sqrt(a)) {
                    vector<ll> x(3);
                    x[0] = z[n];
                    x[1] = z[a/i];
                    x[2] = z[a];
                    sort(x.begin(), x.end());
                    ll f = (modpow(x[2], m + 1, 1000000007) - modpow(x[1], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[1], 1000000007) % 1000000007 * x[1] % 1000000007;
                    ll g = (modpow(x[2], m + 1, 1000000007) - modpow(x[0], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[0], 1000000007) % 1000000007 * x[0] % 1000000007;
                    ans += (f - g + 1000000007) * modinv(x[1] - x[0], 1000000007) % 1000000007;
                }
                vector<ll> x(3);
                x[0] = z[n];
                x[1] = z[a];
                x[2] = z[i];
                sort(x.begin(), x.end());
                ll f = (modpow(x[2], m + 1, 1000000007) - modpow(x[1], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[1], 1000000007) % 1000000007 * x[1] % 1000000007;
                ll g = (modpow(x[2], m + 1, 1000000007) - modpow(x[0], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[0], 1000000007) % 1000000007 * x[0] % 1000000007;
                ans += (f - g + 1000000007) * modinv(x[1] - x[0], 1000000007) % 1000000007;
            }
            for (int i = 0; i < d[a].size(); i++) {
                vector<ll> x(3);
                x[0] = z[n];
                x[1] = z[a];
                x[2] = z[d[a][i]];
                sort(x.begin(), x.end());
                ll f = (modpow(x[2], m + 1, 1000000007) - modpow(x[1], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[1], 1000000007) % 1000000007 * x[1] % 1000000007;
                ll g = (modpow(x[2], m + 1, 1000000007) - modpow(x[0], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[0], 1000000007) % 1000000007 * x[0] % 1000000007;
                ans += (f - g + 1000000007) * modinv(x[1] - x[0], 1000000007) % 1000000007;
            }
        }
        else if (f.count(b)||n%b==0) {
            vector<ll> x(3);
            x[0] = z[n];
            x[1] = z[a];
            x[2] = z[b];
            sort(x.begin(), x.end());
            ll f = (modpow(x[2], m + 1, 1000000007) - modpow(x[1], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[1], 1000000007) % 1000000007 * x[1] % 1000000007;
            ll g = (modpow(x[2], m + 1, 1000000007) - modpow(x[0], m + 1, 1000000007) + 1000000007) * modinv(x[2] - x[0], 1000000007) % 1000000007 * x[0] % 1000000007;
            ans += (f - g + 1000000007) * modinv(x[1] - x[0], 1000000007) % 1000000007;
        }
        ans %= 1000000007;
    }
    cout << ans << endl;
}
0