結果

問題 No.1261 数字集め
ユーザー haruki_Kharuki_K
提出日時 2020-10-17 03:18:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,645 ms / 8,000 ms
コード長 8,397 bytes
コンパイル時間 4,112 ms
コンパイル使用メモリ 209,256 KB
実行使用メモリ 41,748 KB
最終ジャッジ日時 2023-09-28 10:50:58
合計ジャッジ時間 158,199 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,396 ms
38,324 KB
testcase_01 AC 699 ms
25,568 KB
testcase_02 AC 1,613 ms
32,856 KB
testcase_03 AC 1,588 ms
32,872 KB
testcase_04 AC 962 ms
27,860 KB
testcase_05 AC 2,234 ms
37,448 KB
testcase_06 AC 1,075 ms
29,324 KB
testcase_07 AC 1,661 ms
34,184 KB
testcase_08 AC 876 ms
26,800 KB
testcase_09 AC 1,169 ms
29,492 KB
testcase_10 AC 136 ms
20,116 KB
testcase_11 AC 1,990 ms
37,748 KB
testcase_12 AC 1,894 ms
37,672 KB
testcase_13 AC 1,735 ms
34,408 KB
testcase_14 AC 200 ms
22,576 KB
testcase_15 AC 801 ms
28,852 KB
testcase_16 AC 1,730 ms
35,824 KB
testcase_17 AC 1,405 ms
31,588 KB
testcase_18 AC 897 ms
28,484 KB
testcase_19 AC 1,761 ms
35,380 KB
testcase_20 AC 246 ms
23,136 KB
testcase_21 AC 2,401 ms
39,584 KB
testcase_22 AC 2,332 ms
38,708 KB
testcase_23 AC 2,359 ms
39,064 KB
testcase_24 AC 2,297 ms
38,288 KB
testcase_25 AC 2,358 ms
40,412 KB
testcase_26 AC 2,286 ms
41,580 KB
testcase_27 AC 2,170 ms
38,428 KB
testcase_28 AC 2,276 ms
38,796 KB
testcase_29 AC 2,206 ms
38,352 KB
testcase_30 AC 2,278 ms
39,308 KB
testcase_31 AC 2,317 ms
38,780 KB
testcase_32 AC 2,427 ms
38,720 KB
testcase_33 AC 2,363 ms
39,476 KB
testcase_34 AC 2,304 ms
40,924 KB
testcase_35 AC 2,254 ms
38,244 KB
testcase_36 AC 2,187 ms
40,920 KB
testcase_37 AC 2,370 ms
41,368 KB
testcase_38 AC 2,465 ms
41,716 KB
testcase_39 AC 2,365 ms
39,700 KB
testcase_40 AC 2,645 ms
38,100 KB
testcase_41 AC 2,253 ms
38,760 KB
testcase_42 AC 2,284 ms
39,148 KB
testcase_43 AC 2,139 ms
39,448 KB
testcase_44 AC 2,008 ms
38,180 KB
testcase_45 AC 411 ms
25,164 KB
testcase_46 AC 1,088 ms
30,788 KB
testcase_47 AC 712 ms
27,436 KB
testcase_48 AC 1,696 ms
33,916 KB
testcase_49 AC 1,964 ms
35,796 KB
testcase_50 AC 1,656 ms
38,428 KB
testcase_51 AC 446 ms
26,468 KB
testcase_52 AC 145 ms
24,736 KB
testcase_53 AC 362 ms
24,192 KB
testcase_54 AC 464 ms
23,616 KB
testcase_55 AC 246 ms
22,420 KB
testcase_56 AC 377 ms
21,864 KB
testcase_57 AC 1,555 ms
35,280 KB
testcase_58 AC 411 ms
26,492 KB
testcase_59 AC 1,938 ms
36,092 KB
testcase_60 AC 426 ms
26,868 KB
testcase_61 AC 708 ms
25,720 KB
testcase_62 AC 1,774 ms
34,436 KB
testcase_63 AC 261 ms
22,504 KB
testcase_64 AC 2,222 ms
39,488 KB
testcase_65 AC 1,356 ms
31,200 KB
testcase_66 AC 1,183 ms
34,024 KB
testcase_67 AC 1,791 ms
35,528 KB
testcase_68 AC 1,041 ms
28,604 KB
testcase_69 AC 968 ms
30,764 KB
testcase_70 AC 682 ms
26,292 KB
testcase_71 AC 1,724 ms
35,436 KB
testcase_72 AC 490 ms
28,044 KB
testcase_73 AC 580 ms
26,188 KB
testcase_74 AC 329 ms
24,944 KB
testcase_75 AC 996 ms
28,696 KB
testcase_76 AC 1,643 ms
32,900 KB
testcase_77 AC 1,839 ms
34,820 KB
testcase_78 AC 121 ms
23,672 KB
testcase_79 AC 2,029 ms
36,316 KB
testcase_80 AC 123 ms
21,212 KB
testcase_81 AC 211 ms
24,592 KB
testcase_82 AC 1,518 ms
32,716 KB
testcase_83 AC 668 ms
24,860 KB
testcase_84 AC 2,372 ms
41,748 KB
testcase_85 AC 2,377 ms
40,908 KB
testcase_86 AC 2,304 ms
38,356 KB
testcase_87 AC 2,211 ms
38,728 KB
testcase_88 AC 2,273 ms
40,124 KB
testcase_89 AC 2,422 ms
39,280 KB
testcase_90 AC 2,402 ms
40,172 KB
testcase_91 AC 2,418 ms
39,704 KB
testcase_92 AC 2,414 ms
40,520 KB
testcase_93 AC 2,316 ms
38,896 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) {
    using S = typename iterator_traits<It>::value_type;
    using T = conditional_t<is_signed_v<S>,i64,u64>;
    return accumulate(b,e,T{});
}
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<
// >>> modint
template <uint32_t md>
class modint {
    static_assert(md < (1u<<31), "");
    using M = modint;
    using i64 = int64_t;
    uint32_t x;
public:
    static constexpr uint32_t mod = md;
    constexpr modint(i64 x = 0) : x((x%=md) < 0 ? x+md : x) { }
    constexpr i64 val() const { return x; }
    constexpr explicit operator i64() const { return x; }
    constexpr bool operator==(M r) const { return x == r.x; }
    constexpr bool operator!=(M r) const { return x != r.x; }
    constexpr M operator+() const { return *this; }
    constexpr M operator-() const { return M()-*this; }
    constexpr M& operator+=(M r) { x += r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator-=(M r) { x += md-r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator*=(M r) { x = (uint64_t(x)*r.x)%md; return *this; }
    constexpr M& operator/=(M r) { return *this *= r.inv(); }
    constexpr M operator+(M r) const { return M(*this) += r; }
    constexpr M operator-(M r) const { return M(*this) -= r; }
    constexpr M operator*(M r) const { return M(*this) *= r; }
    constexpr M operator/(M r) const { return M(*this) /= r; }
    friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
    friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
    friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
    friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
    constexpr M inv() const { assert(x > 0); return pow(md-2); }
    constexpr M pow(i64 n) const {
        assert(not (x == 0 && n == 0));
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
#ifdef LOCAL
    friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
    friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
    friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; }
};
// <<<
//constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;
mint sgn(int n) { return n%2 == 0 ? +1 : -1; }
// >>> mod table
template <uint32_t mod>
struct ModTable {
    vector<uint32_t> fact = {1,1}, finv = {1,1}, inv = {0,1};
    void calc(int n) {
        int old = fact.size();
        if (n < old) return;
        fact.resize(n+1);
        finv.resize(n+1);
        inv.resize(n+1);
        for (uint32_t i = old; i <= n; i++) {
            fact[i] = uint64_t(fact[i-1])*i % mod;
            inv[i] = mod - uint64_t(inv[mod%i])*(mod/i) % mod;
            finv[i] = uint64_t(finv[i-1])*inv[i] % mod;
        }
    }
};
ModTable<MOD> mod_tab;

modint<MOD> fact(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.fact[n];
}
modint<MOD> finv(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.finv[n];
}
modint<MOD> C(int n, int k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fact(n)*finv(k)*finv(n-k);
}
modint<MOD> P(int n, int k) {
    assert(k >= 0); assert(n >= k);
    return fact(n)*finv(n-k);
}
// <<<

int32_t main() {
    int n,m; cin >> n >> m;
    vector<int> a(n+1);
    rep (i,n-1) cin >> a[i+2];

    vector<mint> p(1e6 + 10);
    rep (i,p.size()) p[i] = mint(i).pow(m-1);
    auto inv = [&](int x) {
        bool sign = (x < 0);
        x = abs(x);
        mod_tab.calc(x);
        mint y = mod_tab.inv[x];
        return sign ? -y : y;
    };

    auto calc = [&](int i, int j) {
        int x = a[i]-1, y = a[j]-1, z = a[n]-1;
        mint ans = p[x]*(y-z) + p[y]*(z-x) + p[z]*(x-y);
        ans *= inv(x-y) * inv(y-z) * inv(z-x) * (-1);
        return ans;
    };

    vector<mint> b(n+1);
    mint ans = 0;
    rep1 (i,n) if (i > 1) {
        for (int j = 2*i; j < n; j += i) {
            dump(i,j,calc(i,j));
            b[j] += calc(i,j);
        }
    }
    vector<int> can(n+1);
    rep1 (j,n-1) if (n % j == 0) ans += b[j], can[j] = 1;
    cout << ans << "\n";
    dump(b);

    int q; cin >> q;
    rep (_,q) {
        int x,y; cin >> x >> y;
        if (y < n) {
            mint val = calc(x,y);
            b[y] += val;
            if (can[y]) ans += val;
        } else {
            ans += b[x];
            can[x] = 1;
        }
        cout << ans << "\n";
    }
}
0