結果

問題 No.1261 数字集め
ユーザー heno239heno239
提出日時 2020-10-16 23:01:39
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 6,308 ms / 8,000 ms
コード長 5,566 bytes
コンパイル時間 2,251 ms
コンパイル使用メモリ 131,756 KB
実行使用メモリ 152,136 KB
最終ジャッジ日時 2023-09-28 09:45:36
合計ジャッジ時間 196,935 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6,308 ms
151,784 KB
testcase_01 AC 1,815 ms
149,160 KB
testcase_02 AC 1,699 ms
150,612 KB
testcase_03 AC 1,713 ms
150,720 KB
testcase_04 AC 1,709 ms
149,656 KB
testcase_05 AC 1,740 ms
151,564 KB
testcase_06 AC 1,721 ms
149,952 KB
testcase_07 AC 1,754 ms
150,776 KB
testcase_08 AC 1,679 ms
149,412 KB
testcase_09 AC 1,705 ms
150,020 KB
testcase_10 AC 1,704 ms
147,808 KB
testcase_11 AC 1,824 ms
151,512 KB
testcase_12 AC 1,794 ms
151,264 KB
testcase_13 AC 1,853 ms
150,808 KB
testcase_14 AC 1,795 ms
148,308 KB
testcase_15 AC 1,827 ms
149,040 KB
testcase_16 AC 1,798 ms
150,776 KB
testcase_17 AC 1,744 ms
150,252 KB
testcase_18 AC 1,709 ms
149,252 KB
testcase_19 AC 1,731 ms
150,924 KB
testcase_20 AC 1,660 ms
148,204 KB
testcase_21 AC 1,763 ms
151,752 KB
testcase_22 AC 1,759 ms
151,732 KB
testcase_23 AC 1,775 ms
151,740 KB
testcase_24 AC 1,809 ms
151,740 KB
testcase_25 AC 1,762 ms
151,748 KB
testcase_26 AC 1,774 ms
151,748 KB
testcase_27 AC 1,787 ms
151,748 KB
testcase_28 AC 1,790 ms
151,788 KB
testcase_29 AC 1,768 ms
151,816 KB
testcase_30 AC 1,766 ms
151,880 KB
testcase_31 AC 1,746 ms
151,940 KB
testcase_32 AC 1,829 ms
151,740 KB
testcase_33 AC 1,826 ms
151,852 KB
testcase_34 AC 1,781 ms
151,812 KB
testcase_35 AC 1,798 ms
151,808 KB
testcase_36 AC 1,780 ms
151,748 KB
testcase_37 AC 1,751 ms
151,812 KB
testcase_38 AC 1,758 ms
151,856 KB
testcase_39 AC 1,770 ms
151,744 KB
testcase_40 AC 1,802 ms
151,724 KB
testcase_41 AC 1,787 ms
151,816 KB
testcase_42 AC 1,765 ms
151,728 KB
testcase_43 AC 1,782 ms
151,808 KB
testcase_44 AC 2,014 ms
151,408 KB
testcase_45 AC 1,998 ms
148,680 KB
testcase_46 AC 1,778 ms
149,576 KB
testcase_47 AC 1,970 ms
148,972 KB
testcase_48 AC 1,860 ms
150,476 KB
testcase_49 AC 1,854 ms
151,108 KB
testcase_50 AC 2,031 ms
150,880 KB
testcase_51 AC 1,755 ms
148,444 KB
testcase_52 AC 1,762 ms
147,452 KB
testcase_53 AC 1,915 ms
148,964 KB
testcase_54 AC 2,017 ms
148,756 KB
testcase_55 AC 1,821 ms
148,348 KB
testcase_56 AC 1,932 ms
148,504 KB
testcase_57 AC 1,923 ms
150,616 KB
testcase_58 AC 1,923 ms
148,680 KB
testcase_59 AC 2,003 ms
151,436 KB
testcase_60 AC 1,908 ms
148,700 KB
testcase_61 AC 1,826 ms
148,972 KB
testcase_62 AC 2,095 ms
151,132 KB
testcase_63 AC 1,742 ms
148,176 KB
testcase_64 AC 2,080 ms
151,676 KB
testcase_65 AC 1,820 ms
150,352 KB
testcase_66 AC 1,804 ms
149,824 KB
testcase_67 AC 1,818 ms
150,820 KB
testcase_68 AC 1,842 ms
149,828 KB
testcase_69 AC 1,819 ms
149,424 KB
testcase_70 AC 1,979 ms
149,360 KB
testcase_71 AC 2,068 ms
150,868 KB
testcase_72 AC 1,974 ms
148,704 KB
testcase_73 AC 1,937 ms
148,996 KB
testcase_74 AC 1,838 ms
148,216 KB
testcase_75 AC 1,949 ms
149,788 KB
testcase_76 AC 1,871 ms
150,532 KB
testcase_77 AC 1,901 ms
150,824 KB
testcase_78 AC 1,827 ms
147,604 KB
testcase_79 AC 1,849 ms
151,116 KB
testcase_80 AC 1,896 ms
147,800 KB
testcase_81 AC 1,880 ms
147,912 KB
testcase_82 AC 2,018 ms
150,580 KB
testcase_83 AC 2,064 ms
149,004 KB
testcase_84 AC 2,177 ms
151,920 KB
testcase_85 AC 2,161 ms
151,936 KB
testcase_86 AC 2,162 ms
152,136 KB
testcase_87 AC 2,139 ms
151,940 KB
testcase_88 AC 2,154 ms
151,936 KB
testcase_89 AC 2,083 ms
152,132 KB
testcase_90 AC 2,096 ms
151,960 KB
testcase_91 AC 2,112 ms
151,928 KB
testcase_92 AC 2,159 ms
151,928 KB
testcase_93 AC 2,139 ms
151,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
struct modint {
    ll n;
    modint() :n(0) { ; }
    modint(ll m) :n(m) {
        if (n >= mod)n %= mod;
        else if (n < 0)n = (n % mod + mod) % mod;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}

typedef array<modint,4> vec;
using mat = array<vec, 4>;
mat mtmul(mat& A, mat& B) {
    mat C;
    rep(i, 4) {
        rep(k, 4) {
            rep(j, 4) {
                C[i][j] += A[i][k] * B[k][j];
            }
        }
    }
    return C;
}
mat mtpow(mat A, ll n) {
    mat B;
    rep(i,4) {
        B[i][i] = 1;
    }
    while (n > 0) {
        if (n & (ll)1)B = mtmul(B, A);
        A = mtmul(A, A);
        n >>= 1;
    }
    return B;
}

int mebius[1 << 20];
vector<int> chcnt(1 << 20);
int loc[1 << 20];
vector<int> ch[1 << 20];
bool isp[1 << 20];
void init() {
    fill(isp + 2, isp + (1 << 20), true);
    fill(mebius, mebius + (1 << 20), 1);
    for (int i = 2; i < (1 << 20); i++) {
        if (!isp[i])continue;
        mebius[i] *= -1;
        for (int j = 2 * i; j < (1 << 20); j += i) {
            isp[j] = false;
            mebius[j] *= -1;
            if ((j / i) % i == 0) {
                mebius[j] = 0;
            }
        }
    }
    for (int i = 2; i < (1 << 20); i++) {
        for (int j = i; j < (1 << 20); j += i) {
            chcnt[j]++;
        }
    }
    for (int i = 2; i < (1 << 20); i++)ch[i].resize(chcnt[i]);
    for (int i = 2; i < (1 << 20); i++) {
        for (int j = i; j < (1 << 20); j += i) {
            ch[j][loc[j]]= i; loc[j]++;
        }
    }
}
void solve() {
    int n, m; cin >> n >> m;
    vector<int> a(n + 1);
    for (int i = 2; i <= n; i++)cin >> a[i];
    modint ans = 0;
    for (int j = 2; j < n; j++) {
        if (n % j)continue;
        for (int d : ch[j])if(d>1&&d<j) {
            mat mt = array<vec,4>{ vec{0,1,0,0},vec{0,a[n] - 1,1,0},vec{0,0,a[j] - 1,1},vec{0,0,0,a[d]-1} };
            mt = mtpow(mt, m);
            ans += mt[0][3];
            //cout << d << " " << j << " " << mt[0][3] << "\n";
        }
    }
    cout << ans << "\n";
    vector<bool> canend(n+1);
    rep1(i, n)if (n % i == 0)canend[i] = true;
    int q; cin >> q;
    rep(i, q) {
        int l, r; cin >> l >> r;
        if (r == n) {
            for (int d : ch[l])if(d>1&&d<l) {
                mat mt = array<vec, 4>{ vec{ 0,1,0,0 }, vec{ 0,a[n] - 1,1,0 }, vec{ 0,0,a[l] - 1,1 }, vec{ 0,0,0,a[d] - 1 } };
                mt = mtpow(mt, m);
                ans += mt[0][3];
            }
            canend[l] = true;
        }
        else {
            if (canend[r]) {
                mat mt = array<vec, 4>{ vec{ 0,1,0,0 }, vec{ 0,a[n] - 1,1,0 }, vec{ 0,0,a[r] - 1,1 }, vec{ 0,0,0,a[l] - 1 } };
                mt = mtpow(mt, m);
                ans += mt[0][3];
            }
            ch[r].push_back(l);
        }
        cout << ans << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    init();
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0