結果
問題 | No.1124 Earthquake Safety |
ユーザー | e869120 |
提出日時 | 2020-07-05 01:11:04 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 464 ms / 3,000 ms |
コード長 | 3,069 bytes |
コンパイル時間 | 1,253 ms |
コンパイル使用メモリ | 73,340 KB |
実行使用メモリ | 92,024 KB |
最終ジャッジ日時 | 2023-10-19 22:35:11 |
合計ジャッジ時間 | 22,870 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 14 ms
28,396 KB |
testcase_01 | AC | 13 ms
34,528 KB |
testcase_02 | AC | 12 ms
30,440 KB |
testcase_03 | AC | 13 ms
28,400 KB |
testcase_04 | AC | 13 ms
36,532 KB |
testcase_05 | AC | 12 ms
30,448 KB |
testcase_06 | AC | 13 ms
28,492 KB |
testcase_07 | AC | 19 ms
31,268 KB |
testcase_08 | AC | 111 ms
42,508 KB |
testcase_09 | AC | 383 ms
60,600 KB |
testcase_10 | AC | 198 ms
92,024 KB |
testcase_11 | AC | 13 ms
36,532 KB |
testcase_12 | AC | 12 ms
36,532 KB |
testcase_13 | AC | 12 ms
36,532 KB |
testcase_14 | AC | 451 ms
61,916 KB |
testcase_15 | AC | 420 ms
61,924 KB |
testcase_16 | AC | 429 ms
61,920 KB |
testcase_17 | AC | 417 ms
61,916 KB |
testcase_18 | AC | 419 ms
61,916 KB |
testcase_19 | AC | 416 ms
61,920 KB |
testcase_20 | AC | 413 ms
61,916 KB |
testcase_21 | AC | 424 ms
61,916 KB |
testcase_22 | AC | 423 ms
61,920 KB |
testcase_23 | AC | 417 ms
62,780 KB |
testcase_24 | AC | 410 ms
62,788 KB |
testcase_25 | AC | 403 ms
62,940 KB |
testcase_26 | AC | 406 ms
62,932 KB |
testcase_27 | AC | 407 ms
64,432 KB |
testcase_28 | AC | 398 ms
64,488 KB |
testcase_29 | AC | 422 ms
69,764 KB |
testcase_30 | AC | 410 ms
69,764 KB |
testcase_31 | AC | 438 ms
81,124 KB |
testcase_32 | AC | 435 ms
79,120 KB |
testcase_33 | AC | 464 ms
80,620 KB |
testcase_34 | AC | 460 ms
82,996 KB |
testcase_35 | AC | 372 ms
61,424 KB |
testcase_36 | AC | 323 ms
59,860 KB |
testcase_37 | AC | 300 ms
60,252 KB |
testcase_38 | AC | 284 ms
60,488 KB |
testcase_39 | AC | 274 ms
59,416 KB |
testcase_40 | AC | 262 ms
60,488 KB |
testcase_41 | AC | 243 ms
59,236 KB |
testcase_42 | AC | 235 ms
59,864 KB |
testcase_43 | AC | 226 ms
60,308 KB |
testcase_44 | AC | 219 ms
60,072 KB |
testcase_45 | AC | 209 ms
59,336 KB |
testcase_46 | AC | 209 ms
59,868 KB |
testcase_47 | AC | 204 ms
59,048 KB |
testcase_48 | AC | 214 ms
58,944 KB |
testcase_49 | AC | 209 ms
58,936 KB |
testcase_50 | AC | 12 ms
32,376 KB |
testcase_51 | AC | 13 ms
36,476 KB |
testcase_52 | AC | 13 ms
36,528 KB |
testcase_53 | AC | 12 ms
36,528 KB |
testcase_54 | AC | 13 ms
36,528 KB |
testcase_55 | AC | 13 ms
36,528 KB |
testcase_56 | AC | 13 ms
36,528 KB |
testcase_57 | AC | 12 ms
36,528 KB |
ソースコード
#include <iostream> #include <vector> using namespace std; #pragma warning (disable: 4996) const long long mod = 1000000007; const long long inv2 = 500000004; const long long inv6 = 166666668; // 入出力 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 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++) { long long s1 = 0, s2 = 0, s3 = 0; for (int j : Y[i]) { s1 += dp1[j]; s2 += dp1[j] * dp1[j] % mod; s3 += (dp1[j] * dp1[j] % mod) * dp1[j] % mod; s1 %= mod; s2 %= mod; s3 %= mod; } long long v1 = (s1 * s1 % mod) * s1 % mod; long long v2 = s1 * s2 % mod; long long v3 = s3; long long res = (v1 - 3LL * v2 + 2LL * v3 + mod * mod) % mod; res = res * inv6 % mod; res = res * inv2 % mod; res = res * inv2 % mod; res = res * inv2 % mod; Answer3C += res; 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; }