結果

問題 No.1261 数字集め
ユーザー tokusakuraitokusakurai
提出日時 2020-10-17 16:56:57
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 2,413 ms / 8,000 ms
コード長 4,100 bytes
コンパイル時間 2,257 ms
コンパイル使用メモリ 204,272 KB
実行使用メモリ 133,604 KB
最終ジャッジ日時 2023-09-28 11:05:29
合計ジャッジ時間 150,991 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,413 ms
133,168 KB
testcase_01 AC 722 ms
56,752 KB
testcase_02 AC 1,512 ms
100,264 KB
testcase_03 AC 1,549 ms
101,408 KB
testcase_04 AC 964 ms
71,112 KB
testcase_05 AC 2,100 ms
128,432 KB
testcase_06 AC 1,127 ms
79,212 KB
testcase_07 AC 1,587 ms
104,240 KB
testcase_08 AC 918 ms
66,752 KB
testcase_09 AC 1,149 ms
81,344 KB
testcase_10 AC 234 ms
22,008 KB
testcase_11 AC 2,048 ms
126,676 KB
testcase_12 AC 1,808 ms
115,188 KB
testcase_13 AC 1,629 ms
105,524 KB
testcase_14 AC 263 ms
27,772 KB
testcase_15 AC 801 ms
61,492 KB
testcase_16 AC 1,611 ms
104,464 KB
testcase_17 AC 1,263 ms
87,608 KB
testcase_18 AC 803 ms
62,244 KB
testcase_19 AC 1,523 ms
101,676 KB
testcase_20 AC 288 ms
30,208 KB
testcase_21 AC 2,195 ms
133,416 KB
testcase_22 AC 2,190 ms
133,376 KB
testcase_23 AC 2,203 ms
133,492 KB
testcase_24 AC 2,175 ms
133,448 KB
testcase_25 AC 2,162 ms
133,412 KB
testcase_26 AC 2,181 ms
133,440 KB
testcase_27 AC 2,174 ms
133,384 KB
testcase_28 AC 2,176 ms
133,408 KB
testcase_29 AC 2,162 ms
133,436 KB
testcase_30 AC 2,180 ms
133,496 KB
testcase_31 AC 2,185 ms
133,460 KB
testcase_32 AC 2,180 ms
133,412 KB
testcase_33 AC 2,183 ms
133,552 KB
testcase_34 AC 2,177 ms
133,384 KB
testcase_35 AC 2,187 ms
133,604 KB
testcase_36 AC 2,200 ms
133,388 KB
testcase_37 AC 2,186 ms
133,428 KB
testcase_38 AC 2,163 ms
133,408 KB
testcase_39 AC 2,125 ms
133,436 KB
testcase_40 AC 2,172 ms
133,400 KB
testcase_41 AC 2,207 ms
133,388 KB
testcase_42 AC 2,189 ms
133,364 KB
testcase_43 AC 2,164 ms
133,416 KB
testcase_44 AC 1,883 ms
119,448 KB
testcase_45 AC 464 ms
42,372 KB
testcase_46 AC 1,014 ms
73,616 KB
testcase_47 AC 733 ms
57,220 KB
testcase_48 AC 1,585 ms
102,784 KB
testcase_49 AC 1,936 ms
118,464 KB
testcase_50 AC 1,668 ms
107,492 KB
testcase_51 AC 497 ms
45,116 KB
testcase_52 AC 236 ms
21,332 KB
testcase_53 AC 480 ms
45,288 KB
testcase_54 AC 566 ms
48,524 KB
testcase_55 AC 313 ms
32,264 KB
testcase_56 AC 370 ms
35,572 KB
testcase_57 AC 1,498 ms
98,424 KB
testcase_58 AC 455 ms
42,912 KB
testcase_59 AC 1,945 ms
121,168 KB
testcase_60 AC 543 ms
47,772 KB
testcase_61 AC 739 ms
58,452 KB
testcase_62 AC 1,746 ms
110,500 KB
testcase_63 AC 324 ms
34,056 KB
testcase_64 AC 2,130 ms
129,348 KB
testcase_65 AC 1,344 ms
91,080 KB
testcase_66 AC 1,112 ms
79,528 KB
testcase_67 AC 1,731 ms
111,380 KB
testcase_68 AC 1,089 ms
76,388 KB
testcase_69 AC 1,037 ms
75,068 KB
testcase_70 AC 826 ms
63,580 KB
testcase_71 AC 1,663 ms
105,828 KB
testcase_72 AC 613 ms
51,368 KB
testcase_73 AC 704 ms
56,572 KB
testcase_74 AC 364 ms
35,840 KB
testcase_75 AC 984 ms
71,564 KB
testcase_76 AC 1,504 ms
98,508 KB
testcase_77 AC 1,753 ms
112,040 KB
testcase_78 AC 222 ms
19,888 KB
testcase_79 AC 1,820 ms
115,328 KB
testcase_80 AC 225 ms
21,112 KB
testcase_81 AC 262 ms
28,680 KB
testcase_82 AC 1,416 ms
94,088 KB
testcase_83 AC 656 ms
53,152 KB
testcase_84 AC 2,265 ms
133,448 KB
testcase_85 AC 2,203 ms
133,388 KB
testcase_86 AC 2,240 ms
133,372 KB
testcase_87 AC 2,220 ms
133,544 KB
testcase_88 AC 2,294 ms
133,400 KB
testcase_89 AC 2,204 ms
133,372 KB
testcase_90 AC 2,243 ms
133,404 KB
testcase_91 AC 2,168 ms
133,504 KB
testcase_92 AC 2,265 ms
133,472 KB
testcase_93 AC 2,190 ms
133,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

template<int mod>
struct Mod_Int{
    ll x;

    Mod_Int() : x(0) {}

    Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        x = (x + p.x) % mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        x = (x + mod - p.x) % mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (x * p.x) % mod;
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(ll k) const{
        Mod_Int now = *this, ret = 1;
        while(k){
            if(k&1) ret *= now;
            now *= now, k >>= 1;
        }
        return ret;
    }

    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }

    friend istream &operator >> (istream &is, Mod_Int &p){
        ll a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

const int MAX = 1000000;
int A[MAX+1];
mint iv[MAX+1], pw[MAX+1];

mint inv(int a){
    if(a > 0) return iv[a];
    else return iv[abs(a)]*(-1);
}

mint calc(int i, int j, int k){
    int a = A[i], b = A[j], c = A[k];
    return (pw[a]*(b-c)+pw[b]*(c-a)+pw[c]*(a-b))*inv(a-b)*inv(b-c)*inv(c-a);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, M;
    cin >> N >> M;
    
    rep2(i, 2, N){
        cin >> A[i];
        A[i]--;
    }
    bool st[N+1], en[N+1];
    fill(st, st+N+1, false), fill(en, en+N+1, false);
    rep2(i, 2, N-1){
        st[i] = true, en[i] = (N%i == 0);
    }
    
    rep2(i, 1, MAX) iv[i] = mint(i).inverse();
    rep2(i, 1, MAX) pw[i] = mint(i).pow(M-1);

    vector<int> es[N+1];

    mint ans = 0;
    rep2(i, 2, N-1){
        for(int j = i+i; j <= N; j += i){
            es[j].pb(i);
            if(st[i] && en[j]) ans -= calc(i, j, N);
        }
    }

    cout << ans << '\n';

    int Q;
    cin >> Q;

    while(Q--){
        int x, y; cin >> x >> y;
        if(y < N){
            es[y].pb(x);
            if(st[x] && en[y]) ans -= calc(x, y, N);
        }
        else{
            en[x] = true;
            for(auto &e: es[x]){
                if(st[e]) ans -= calc(e, x, N);
            }
        }
        cout << ans << '\n';
    }
}
0