結果
問題 | No.1261 数字集め |
ユーザー | simasima_71 |
提出日時 | 2020-10-16 23:26:25 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,141 ms / 8,000 ms |
コード長 | 7,539 bytes |
コンパイル時間 | 1,675 ms |
コンパイル使用メモリ | 135,428 KB |
実行使用メモリ | 34,780 KB |
最終ジャッジ日時 | 2023-09-28 09:59:06 |
合計ジャッジ時間 | 35,351 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2,141 ms
34,680 KB |
testcase_01 | AC | 99 ms
13,908 KB |
testcase_02 | AC | 198 ms
25,652 KB |
testcase_03 | AC | 206 ms
25,820 KB |
testcase_04 | AC | 132 ms
17,688 KB |
testcase_05 | AC | 278 ms
33,264 KB |
testcase_06 | AC | 154 ms
19,688 KB |
testcase_07 | AC | 225 ms
26,660 KB |
testcase_08 | AC | 130 ms
16,236 KB |
testcase_09 | AC | 175 ms
20,380 KB |
testcase_10 | AC | 9 ms
4,380 KB |
testcase_11 | AC | 262 ms
32,644 KB |
testcase_12 | AC | 243 ms
29,548 KB |
testcase_13 | AC | 220 ms
26,948 KB |
testcase_14 | AC | 27 ms
5,800 KB |
testcase_15 | AC | 114 ms
14,772 KB |
testcase_16 | AC | 223 ms
26,864 KB |
testcase_17 | AC | 191 ms
22,152 KB |
testcase_18 | AC | 113 ms
15,040 KB |
testcase_19 | AC | 203 ms
25,976 KB |
testcase_20 | AC | 32 ms
6,260 KB |
testcase_21 | AC | 279 ms
34,264 KB |
testcase_22 | AC | 277 ms
34,308 KB |
testcase_23 | AC | 283 ms
34,268 KB |
testcase_24 | AC | 313 ms
34,352 KB |
testcase_25 | AC | 325 ms
34,308 KB |
testcase_26 | AC | 309 ms
34,352 KB |
testcase_27 | AC | 310 ms
34,572 KB |
testcase_28 | AC | 308 ms
34,416 KB |
testcase_29 | AC | 320 ms
34,268 KB |
testcase_30 | AC | 307 ms
34,480 KB |
testcase_31 | AC | 308 ms
34,340 KB |
testcase_32 | AC | 304 ms
34,348 KB |
testcase_33 | AC | 311 ms
34,356 KB |
testcase_34 | AC | 310 ms
34,308 KB |
testcase_35 | AC | 305 ms
34,348 KB |
testcase_36 | AC | 309 ms
34,340 KB |
testcase_37 | AC | 308 ms
34,352 KB |
testcase_38 | AC | 310 ms
34,356 KB |
testcase_39 | AC | 307 ms
34,356 KB |
testcase_40 | AC | 302 ms
34,412 KB |
testcase_41 | AC | 307 ms
34,352 KB |
testcase_42 | AC | 311 ms
34,260 KB |
testcase_43 | AC | 312 ms
34,352 KB |
testcase_44 | AC | 353 ms
30,932 KB |
testcase_45 | AC | 163 ms
9,628 KB |
testcase_46 | AC | 139 ms
18,124 KB |
testcase_47 | AC | 191 ms
13,928 KB |
testcase_48 | AC | 268 ms
26,388 KB |
testcase_49 | AC | 278 ms
30,372 KB |
testcase_50 | AC | 342 ms
27,708 KB |
testcase_51 | AC | 87 ms
10,348 KB |
testcase_52 | AC | 38 ms
4,376 KB |
testcase_53 | AC | 143 ms
10,272 KB |
testcase_54 | AC | 212 ms
11,356 KB |
testcase_55 | AC | 91 ms
7,048 KB |
testcase_56 | AC | 158 ms
8,308 KB |
testcase_57 | AC | 266 ms
25,136 KB |
testcase_58 | AC | 133 ms
9,824 KB |
testcase_59 | AC | 394 ms
31,624 KB |
testcase_60 | AC | 150 ms
11,064 KB |
testcase_61 | AC | 163 ms
14,172 KB |
testcase_62 | AC | 394 ms
28,408 KB |
testcase_63 | AC | 56 ms
7,432 KB |
testcase_64 | AC | 412 ms
33,568 KB |
testcase_65 | AC | 227 ms
23,036 KB |
testcase_66 | AC | 176 ms
19,692 KB |
testcase_67 | AC | 245 ms
28,724 KB |
testcase_68 | AC | 179 ms
19,048 KB |
testcase_69 | AC | 155 ms
18,864 KB |
testcase_70 | AC | 228 ms
15,756 KB |
testcase_71 | AC | 332 ms
27,416 KB |
testcase_72 | AC | 168 ms
12,084 KB |
testcase_73 | AC | 167 ms
13,712 KB |
testcase_74 | AC | 89 ms
8,104 KB |
testcase_75 | AC | 255 ms
17,892 KB |
testcase_76 | AC | 253 ms
25,256 KB |
testcase_77 | AC | 290 ms
28,736 KB |
testcase_78 | AC | 38 ms
4,376 KB |
testcase_79 | AC | 300 ms
29,804 KB |
testcase_80 | AC | 87 ms
4,380 KB |
testcase_81 | AC | 82 ms
6,000 KB |
testcase_82 | AC | 281 ms
24,136 KB |
testcase_83 | AC | 214 ms
12,992 KB |
testcase_84 | AC | 493 ms
34,632 KB |
testcase_85 | AC | 476 ms
34,620 KB |
testcase_86 | AC | 485 ms
34,780 KB |
testcase_87 | AC | 468 ms
34,548 KB |
testcase_88 | AC | 483 ms
34,688 KB |
testcase_89 | AC | 471 ms
34,752 KB |
testcase_90 | AC | 477 ms
34,680 KB |
testcase_91 | AC | 489 ms
34,544 KB |
testcase_92 | AC | 471 ms
34,608 KB |
testcase_93 | AC | 472 ms
34,684 KB |
ソースコード
#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; }