結果
問題 | No.1261 数字集め |
ユーザー | 👑 emthrm |
提出日時 | 2020-10-18 17:56:46 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,946 ms / 8,000 ms |
コード長 | 5,586 bytes |
コンパイル時間 | 3,132 ms |
コンパイル使用メモリ | 211,948 KB |
実行使用メモリ | 115,936 KB |
最終ジャッジ日時 | 2023-09-28 12:00:24 |
合計ジャッジ時間 | 135,295 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2,946 ms
115,556 KB |
testcase_01 | AC | 483 ms
40,364 KB |
testcase_02 | AC | 1,297 ms
83,072 KB |
testcase_03 | AC | 1,360 ms
84,000 KB |
testcase_04 | AC | 764 ms
54,148 KB |
testcase_05 | AC | 1,879 ms
110,672 KB |
testcase_06 | AC | 873 ms
61,448 KB |
testcase_07 | AC | 1,331 ms
86,872 KB |
testcase_08 | AC | 612 ms
48,976 KB |
testcase_09 | AC | 898 ms
63,740 KB |
testcase_10 | AC | 12 ms
5,612 KB |
testcase_11 | AC | 1,764 ms
109,228 KB |
testcase_12 | AC | 1,524 ms
97,592 KB |
testcase_13 | AC | 1,348 ms
88,268 KB |
testcase_14 | AC | 47 ms
11,424 KB |
testcase_15 | AC | 496 ms
43,648 KB |
testcase_16 | AC | 1,310 ms
87,196 KB |
testcase_17 | AC | 1,018 ms
70,404 KB |
testcase_18 | AC | 536 ms
44,500 KB |
testcase_19 | AC | 1,267 ms
84,304 KB |
testcase_20 | AC | 68 ms
13,520 KB |
testcase_21 | AC | 1,975 ms
115,628 KB |
testcase_22 | AC | 1,989 ms
115,688 KB |
testcase_23 | AC | 1,962 ms
115,412 KB |
testcase_24 | AC | 1,896 ms
115,468 KB |
testcase_25 | AC | 1,888 ms
115,444 KB |
testcase_26 | AC | 1,882 ms
115,632 KB |
testcase_27 | AC | 1,989 ms
115,756 KB |
testcase_28 | AC | 1,878 ms
115,492 KB |
testcase_29 | AC | 1,964 ms
115,928 KB |
testcase_30 | AC | 1,937 ms
115,800 KB |
testcase_31 | AC | 2,005 ms
115,492 KB |
testcase_32 | AC | 1,964 ms
115,932 KB |
testcase_33 | AC | 1,989 ms
115,476 KB |
testcase_34 | AC | 1,992 ms
115,716 KB |
testcase_35 | AC | 1,996 ms
115,444 KB |
testcase_36 | AC | 2,120 ms
115,688 KB |
testcase_37 | AC | 2,043 ms
115,760 KB |
testcase_38 | AC | 2,105 ms
115,764 KB |
testcase_39 | AC | 2,089 ms
115,664 KB |
testcase_40 | AC | 2,034 ms
115,468 KB |
testcase_41 | AC | 2,059 ms
115,724 KB |
testcase_42 | AC | 2,042 ms
115,412 KB |
testcase_43 | AC | 2,068 ms
115,412 KB |
testcase_44 | AC | 1,723 ms
101,856 KB |
testcase_45 | AC | 259 ms
24,372 KB |
testcase_46 | AC | 832 ms
56,008 KB |
testcase_47 | AC | 523 ms
39,180 KB |
testcase_48 | AC | 1,421 ms
85,420 KB |
testcase_49 | AC | 1,688 ms
100,736 KB |
testcase_50 | AC | 1,529 ms
90,044 KB |
testcase_51 | AC | 287 ms
27,080 KB |
testcase_52 | AC | 23 ms
4,516 KB |
testcase_53 | AC | 320 ms
27,136 KB |
testcase_54 | AC | 408 ms
30,224 KB |
testcase_55 | AC | 117 ms
15,604 KB |
testcase_56 | AC | 191 ms
19,224 KB |
testcase_57 | AC | 1,357 ms
81,120 KB |
testcase_58 | AC | 281 ms
24,860 KB |
testcase_59 | AC | 1,866 ms
103,716 KB |
testcase_60 | AC | 363 ms
29,748 KB |
testcase_61 | AC | 564 ms
40,872 KB |
testcase_62 | AC | 1,632 ms
92,680 KB |
testcase_63 | AC | 133 ms
17,768 KB |
testcase_64 | AC | 2,054 ms
111,476 KB |
testcase_65 | AC | 1,187 ms
73,772 KB |
testcase_66 | AC | 960 ms
62,064 KB |
testcase_67 | AC | 1,611 ms
93,788 KB |
testcase_68 | AC | 890 ms
58,688 KB |
testcase_69 | AC | 863 ms
57,300 KB |
testcase_70 | AC | 649 ms
45,520 KB |
testcase_71 | AC | 1,501 ms
88,796 KB |
testcase_72 | AC | 413 ms
33,152 KB |
testcase_73 | AC | 511 ms
38,708 KB |
testcase_74 | AC | 169 ms
19,676 KB |
testcase_75 | AC | 809 ms
53,844 KB |
testcase_76 | AC | 1,313 ms
81,352 KB |
testcase_77 | AC | 1,590 ms
94,584 KB |
testcase_78 | AC | 19 ms
4,380 KB |
testcase_79 | AC | 1,617 ms
98,204 KB |
testcase_80 | AC | 43 ms
4,572 KB |
testcase_81 | AC | 77 ms
12,168 KB |
testcase_82 | AC | 1,219 ms
76,688 KB |
testcase_83 | AC | 418 ms
35,008 KB |
testcase_84 | AC | 1,991 ms
115,472 KB |
testcase_85 | AC | 2,017 ms
115,660 KB |
testcase_86 | AC | 2,093 ms
115,472 KB |
testcase_87 | AC | 2,107 ms
115,764 KB |
testcase_88 | AC | 2,092 ms
115,868 KB |
testcase_89 | AC | 2,043 ms
115,716 KB |
testcase_90 | AC | 2,066 ms
115,936 KB |
testcase_91 | AC | 2,075 ms
115,632 KB |
testcase_92 | AC | 2,021 ms
115,436 KB |
testcase_93 | AC | 2,008 ms
115,436 KB |
ソースコード
#define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; template <int MOD> struct MInt { unsigned val; MInt(): val(0) {} MInt(long long x) : val(x >= 0 ? x % MOD : x % MOD + MOD) {} static int get_mod() { return MOD; } static void set_mod(int divisor) { assert(divisor == MOD); } MInt pow(long long exponent) const { MInt tmp = *this, res = 1; while (exponent > 0) { if (exponent & 1) res *= tmp; tmp *= tmp; exponent >>= 1; } return res; } MInt &operator+=(const MInt &x) { if((val += x.val) >= MOD) val -= MOD; return *this; } MInt &operator-=(const MInt &x) { if((val += MOD - x.val) >= MOD) val -= MOD; return *this; } MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % MOD; return *this; } MInt &operator/=(const MInt &x) { // assert(std::__gcd(static_cast<int>(x.val), MOD) == 1); unsigned a = x.val, b = MOD; int u = 1, v = 0; while (b) { unsigned tmp = a / b; std::swap(a -= tmp * b, b); std::swap(u -= tmp * v, v); } return *this *= u; } bool operator==(const MInt &x) const { return val == x.val; } bool operator!=(const MInt &x) const { return val != x.val; } bool operator<(const MInt &x) const { return val < x.val; } bool operator<=(const MInt &x) const { return val <= x.val; } bool operator>(const MInt &x) const { return val > x.val; } bool operator>=(const MInt &x) const { return val >= x.val; } MInt &operator++() { if (++val == MOD) val = 0; return *this; } MInt operator++(int) { MInt res = *this; ++*this; return res; } MInt &operator--() { val = (val == 0 ? MOD : val) - 1; return *this; } MInt operator--(int) { MInt res = *this; --*this; return res; } MInt operator+() const { return *this; } MInt operator-() const { return MInt(val ? MOD - val : 0); } MInt operator+(const MInt &x) const { return MInt(*this) += x; } MInt operator-(const MInt &x) const { return MInt(*this) -= x; } MInt operator*(const MInt &x) const { return MInt(*this) *= x; } MInt operator/(const MInt &x) const { return MInt(*this) /= x; } friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; } friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; } }; namespace std { template <int MOD> MInt<MOD> abs(const MInt<MOD> &x) { return x; } } template <int MOD> struct Combinatorics { using ModInt = MInt<MOD>; int val; // "val!" and "mod" must be disjoint. std::vector<ModInt> fact, fact_inv, inv; Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) { fact[0] = 1; for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i; fact_inv[val] = ModInt(1) / fact[val]; for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i; for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i]; } ModInt nCk(int n, int k) const { if (n < 0 || n < k || k < 0) return 0; assert(n <= val && k <= val); return fact[n] * fact_inv[k] * fact_inv[n - k]; } ModInt nPk(int n, int k) const { if (n < 0 || n < k || k < 0) return 0; assert(n <= val); return fact[n] * fact_inv[n - k]; } ModInt nHk(int n, int k) const { if (n < 0 || k < 0) return 0; return k == 0 ? 1 : nCk(n + k - 1, k); } }; using ModInt = MInt<MOD>; ModInt solve(int a, int b, int c, int m) { vector<int> d{a, b, c}; sort(ALL(d)); int x = d[0], y = d[1], z = d[2]; if (x == z) { return ModInt(x).pow(m) * (m + 1) * (m + 2) / 2; } else if (x == y) { return (ModInt(x).pow(m + 1) * (ModInt(m + 1) * x - ModInt(m + 2) * z) + ModInt(z).pow(m + 2)) / ModInt(x - z).pow(2); } else if (y == z) { return (ModInt(x).pow(m + 2) - ModInt(y).pow(m + 1) * (ModInt(m + 1) * y - ModInt(m + 2) * x)) / ModInt(x - y).pow(2); } else { return (ModInt(x).pow(m + 2) * (y - z) + (ModInt(z).pow(m + 2) - ModInt(y).pow(m + 2)) * x + (ModInt(y).pow(m + 1) - ModInt(z).pow(m + 1)) * y * z) / (x - y) / (y - z) / (x - z); } } int main() { int n, m; cin >> n >> m; m -= 3; vector<int> a(n + 1); FOR(i, 2, n + 1) cin >> a[i], --a[i]; vector<bool> to_n(n, false); FOR(i, 3, n) to_n[i] = n % i == 0; vector<vector<int>> from(n); ModInt ans = 0; FOR(i, 2, n) for (int j = i * 2; j < n; j += i) { from[j].emplace_back(i); if (to_n[j]) ans += solve(a[i], a[j], a[n], m); } cout << ans << '\n'; int q; cin >> q; while (q--) { int x, y; cin >> x >> y; if (y == n) { to_n[x] = true; for (int e : from[x]) ans += solve(a[e], a[x], a[n], m); } else { from[y].emplace_back(x); if (to_n[y]) ans += solve(a[x], a[y], a[n], m); } cout << ans << '\n'; } return 0; }