結果
問題 | No.1124 Earthquake Safety |
ユーザー | e869120 |
提出日時 | 2020-07-03 13:42:43 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 435 ms / 3,000 ms |
コード長 | 2,984 bytes |
コンパイル時間 | 1,129 ms |
コンパイル使用メモリ | 72,956 KB |
実行使用メモリ | 87,824 KB |
最終ジャッジ日時 | 2023-10-14 23:37:35 |
合計ジャッジ時間 | 18,129 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
28,124 KB |
testcase_01 | AC | 21 ms
28,196 KB |
testcase_02 | AC | 21 ms
28,056 KB |
testcase_03 | AC | 21 ms
27,980 KB |
testcase_04 | AC | 20 ms
28,068 KB |
testcase_05 | AC | 21 ms
28,040 KB |
testcase_06 | AC | 23 ms
28,092 KB |
testcase_07 | AC | 26 ms
28,960 KB |
testcase_08 | AC | 93 ms
37,140 KB |
testcase_09 | AC | 354 ms
55,524 KB |
testcase_10 | AC | 191 ms
87,824 KB |
testcase_11 | AC | 20 ms
28,108 KB |
testcase_12 | AC | 21 ms
28,128 KB |
testcase_13 | AC | 21 ms
28,108 KB |
testcase_14 | AC | 384 ms
55,516 KB |
testcase_15 | AC | 348 ms
55,524 KB |
testcase_16 | AC | 382 ms
55,576 KB |
testcase_17 | AC | 368 ms
55,432 KB |
testcase_18 | AC | 355 ms
55,760 KB |
testcase_19 | AC | 360 ms
55,480 KB |
testcase_20 | AC | 361 ms
55,760 KB |
testcase_21 | AC | 348 ms
55,480 KB |
testcase_22 | AC | 344 ms
55,632 KB |
testcase_23 | AC | 347 ms
56,580 KB |
testcase_24 | AC | 352 ms
56,516 KB |
testcase_25 | AC | 327 ms
56,504 KB |
testcase_26 | AC | 348 ms
56,572 KB |
testcase_27 | AC | 331 ms
58,012 KB |
testcase_28 | AC | 355 ms
58,124 KB |
testcase_29 | AC | 395 ms
63,268 KB |
testcase_30 | AC | 353 ms
63,368 KB |
testcase_31 | AC | 396 ms
74,788 KB |
testcase_32 | AC | 408 ms
72,704 KB |
testcase_33 | AC | 391 ms
74,320 KB |
testcase_34 | AC | 435 ms
76,548 KB |
testcase_35 | AC | 299 ms
55,000 KB |
testcase_36 | AC | 316 ms
53,496 KB |
testcase_37 | AC | 291 ms
53,800 KB |
testcase_38 | AC | 299 ms
54,148 KB |
testcase_39 | AC | 252 ms
53,064 KB |
testcase_40 | AC | 246 ms
53,984 KB |
testcase_41 | AC | 234 ms
52,828 KB |
testcase_42 | AC | 225 ms
53,456 KB |
testcase_43 | AC | 223 ms
53,864 KB |
testcase_44 | AC | 210 ms
53,672 KB |
testcase_45 | AC | 210 ms
52,840 KB |
testcase_46 | AC | 209 ms
53,608 KB |
testcase_47 | AC | 205 ms
52,836 KB |
testcase_48 | AC | 204 ms
53,568 KB |
testcase_49 | AC | 207 ms
61,596 KB |
testcase_50 | AC | 19 ms
28,012 KB |
testcase_51 | AC | 21 ms
28,264 KB |
testcase_52 | AC | 21 ms
28,032 KB |
testcase_53 | AC | 21 ms
28,104 KB |
testcase_54 | AC | 21 ms
28,124 KB |
testcase_55 | AC | 21 ms
28,040 KB |
testcase_56 | AC | 21 ms
28,056 KB |
testcase_57 | AC | 21 ms
28,016 KB |
ソースコード
#include <iostream> #include <vector> using namespace std; #pragma warning (disable: 4996) const long long mod = 1000000007; const long long inv2 = 500000004; // 入出力 long long N, A[1 << 19], B[1 << 19]; long long Answer1, Answer2, Answer3A, Answer3B, Answer3C; vector<int> X[1 << 19]; vector<int> Y[1 << 19]; // DP int par[1 << 19]; long long dp1[1 << 19]; long long dp2[1 << 19]; long long dpr[1 << 19][4]; long long Eval[1 << 19]; void dfs1(int pos) { dp1[pos] += 1LL; for (int i : X[pos]) { if (dp1[i] != 0LL) continue; dfs1(i); par[i] = pos; Y[pos].push_back(i); dp1[pos] += dp1[i] * inv2 % mod; dp1[pos] %= mod; } } void dfs2(int pos) { for (int i : Y[pos]) { dp2[i] += dp2[pos] * inv2 % mod; dp2[i] += dp1[pos] * inv2 % mod; dp2[i] -= dp1[i] * (inv2 * inv2 % mod) % mod; dp2[i] = (dp2[i] + mod * mod) % mod; dfs2(i); } } void getEval() { for (int i = 1; i <= N; i++) { long long r = 0, s1 = 0, s2 = 0; for (int j : Y[i]) s1 += dp1[j] * inv2 % mod; for (int j : Y[i]) s2 += (dp1[j] * inv2 % mod) * (dp1[j] * inv2 % mod) % mod; s1 %= mod; s2 %= mod; r = s1 * s1 - s2; r = (r + mod * mod) % mod; Eval[i] = r * inv2 % mod; } } int main() { // Step #1. 入力 scanf("%lld", &N); for (int i = 1; i <= N - 1; i++) scanf("%lld%lld", &A[i], &B[i]); for (int i = 1; i <= N - 1; i++) { X[A[i]].push_back(B[i]); X[B[i]].push_back(A[i]); } // Step #2. 全方位木DP dfs1(1); dfs2(1); // Step #3. [1], [2] の場合を求める Answer1 = N; getEval(); for (int i = 1; i <= N; i++) Answer2 += (dp1[i] + mod - 1LL) % mod; for (int i = 1; i <= N; i++) Answer2 += Eval[i]; Answer2 %= mod; // Step #4. [3] の場合 - Pattern A for (int i = 1; i <= N; i++) { long long r1 = (dp1[i] - 1LL); long long r2 = dp2[i]; Answer3A += r1 * r2 % mod; Answer3A %= mod; } for (int i = 1; i <= N; i++) { Answer3A += Eval[i]; Answer3A %= mod; } // Step #5. [3] の場合 - Pattern B for (int i = 1; i <= N; i++) { long long r1 = dp2[i]; long long r2 = Eval[i]; Answer3B += r1 * r2 % mod; Answer3B %= mod; } // Step #6. [3] の場合 - Pattern C for (int i = 1; i <= N; i++) { for (int j = 0; j <= Y[i].size(); j++) { dpr[j][0] = 0; dpr[j][1] = 0; dpr[j][2] = 0; dpr[j][3] = 0; } dpr[0][0] = 1; for (int j = 0; j < Y[i].size(); j++) { for (int k = 0; k <= 3; k++) dpr[j + 1][k] = dpr[j][k]; for (int k = 0; k <= 2; k++) { dpr[j + 1][k + 1] += dpr[j][k] * (dp1[Y[i][j]] * inv2 % mod) % mod; dpr[j + 1][k + 1] %= mod; } } Answer3C += dpr[Y[i].size()][3]; Answer3C %= mod; } // Step #7. 出力 long long Ret1 = Answer1; long long Ret2 = Answer2; long long Ret3 = (Answer3A + Answer3B + Answer3C) % mod; for (int i = 1; i <= N - 1; i++) { Ret1 *= 2LL; Ret1 %= mod; } for (int i = 1; i <= N - 1; i++) { Ret2 *= 2LL; Ret2 %= mod; } for (int i = 1; i <= N - 1; i++) { Ret3 *= 2LL; Ret3 %= mod; } cout << (1LL * Ret1 + 6LL * Ret2 + 6LL * Ret3) % mod << endl; return 0; }