結果
問題 | No.1124 Earthquake Safety |
ユーザー | QCFium |
提出日時 | 2020-07-03 16:18:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,209 ms / 3,000 ms |
コード長 | 1,576 bytes |
コンパイル時間 | 345 ms |
コンパイル使用メモリ | 87,024 KB |
実行使用メモリ | 175,556 KB |
最終ジャッジ日時 | 2023-10-14 23:44:55 |
合計ジャッジ時間 | 47,441 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
71,148 KB |
testcase_01 | AC | 79 ms
71,204 KB |
testcase_02 | AC | 78 ms
71,124 KB |
testcase_03 | AC | 78 ms
71,192 KB |
testcase_04 | AC | 78 ms
71,256 KB |
testcase_05 | AC | 80 ms
71,148 KB |
testcase_06 | AC | 150 ms
78,132 KB |
testcase_07 | AC | 178 ms
79,704 KB |
testcase_08 | AC | 417 ms
91,220 KB |
testcase_09 | AC | 1,078 ms
118,636 KB |
testcase_10 | AC | 694 ms
175,556 KB |
testcase_11 | AC | 77 ms
71,260 KB |
testcase_12 | AC | 76 ms
71,260 KB |
testcase_13 | AC | 77 ms
70,820 KB |
testcase_14 | AC | 1,162 ms
118,584 KB |
testcase_15 | AC | 1,177 ms
119,200 KB |
testcase_16 | AC | 1,176 ms
119,508 KB |
testcase_17 | AC | 1,188 ms
118,664 KB |
testcase_18 | AC | 1,209 ms
119,520 KB |
testcase_19 | AC | 1,184 ms
118,752 KB |
testcase_20 | AC | 1,188 ms
118,624 KB |
testcase_21 | AC | 1,177 ms
119,156 KB |
testcase_22 | AC | 1,164 ms
117,988 KB |
testcase_23 | AC | 1,080 ms
117,404 KB |
testcase_24 | AC | 1,075 ms
117,480 KB |
testcase_25 | AC | 991 ms
118,328 KB |
testcase_26 | AC | 998 ms
117,608 KB |
testcase_27 | AC | 966 ms
120,152 KB |
testcase_28 | AC | 990 ms
120,356 KB |
testcase_29 | AC | 1,035 ms
131,304 KB |
testcase_30 | AC | 1,057 ms
131,760 KB |
testcase_31 | AC | 1,084 ms
149,736 KB |
testcase_32 | AC | 1,123 ms
148,280 KB |
testcase_33 | AC | 1,129 ms
171,944 KB |
testcase_34 | AC | 1,134 ms
171,288 KB |
testcase_35 | AC | 963 ms
117,176 KB |
testcase_36 | AC | 936 ms
118,176 KB |
testcase_37 | AC | 955 ms
122,824 KB |
testcase_38 | AC | 964 ms
122,020 KB |
testcase_39 | AC | 931 ms
120,324 KB |
testcase_40 | AC | 954 ms
121,492 KB |
testcase_41 | AC | 950 ms
119,996 KB |
testcase_42 | AC | 910 ms
119,900 KB |
testcase_43 | AC | 909 ms
119,924 KB |
testcase_44 | AC | 959 ms
120,496 KB |
testcase_45 | AC | 980 ms
119,288 KB |
testcase_46 | AC | 989 ms
119,160 KB |
testcase_47 | AC | 985 ms
121,912 KB |
testcase_48 | AC | 985 ms
124,920 KB |
testcase_49 | AC | 1,003 ms
152,016 KB |
testcase_50 | AC | 77 ms
70,940 KB |
testcase_51 | AC | 75 ms
71,108 KB |
testcase_52 | AC | 77 ms
71,216 KB |
testcase_53 | AC | 77 ms
71,060 KB |
testcase_54 | AC | 76 ms
71,084 KB |
testcase_55 | AC | 76 ms
71,216 KB |
testcase_56 | AC | 76 ms
71,136 KB |
testcase_57 | AC | 77 ms
71,108 KB |
ソースコード
import sys sys.setrecursionlimit(400000) MOD = 1000000007 inv2 = 500000004 def dfs0(i) : stack = [[-1, -1], [i, 0]] while len(stack) > 1 : i = stack[-1][0] j = stack[-1][1] if j == len(hen[i]) : stack.pop(-1) if len(stack) > 1 : subtree_dsum[stack[-1][0]] = (subtree_dsum[stack[-1][0]] + subtree_dsum[i] * inv2) % MOD else : stack[-1][1] += 1 if hen[i][j] != stack[-2][0] : stack.append([hen[i][j], 0]) res = 0 def dfs1(i) : global res stack = [[-1, -1, -1], [i, 0, 0]] sum1_global = [0 for i in range(n)] while len(stack) > 1 : i = stack[-1][0] j = stack[-1][1] if not j : all = [] if len(stack) > 2 : all.append(stack[-1][2]) for k in hen[i] : if k != stack[-2][0] : all.append(subtree_dsum[k]) sum1 = sum(all) % MOD sum1_global[i] = sum1 sum2 = sum(map(lambda i : i * i, all)) % MOD sum3 = sum(map(lambda i : i * i % MOD * i, all)) % MOD res = (res \ + sum1 * sum1 % MOD * sum1 - sum2 * sum1 * 3 + sum3 * 2 \ + (sum1 * sum1 - sum2) * 3 \ + sum1 * 3 + 1) % MOD if res < 0 : res += MOD if j == len(hen[i]) : stack.pop(-1) else : stack[-1][1] += 1 if hen[i][j] != stack[-2][0] : next = (sum1_global[i] - subtree_dsum[hen[i][j]] + 1) * inv2 % MOD if next < 0 : next += MOD stack.append([hen[i][j], 0, next]) n = int(input()) hen = [[] for i in range(n)] for i in range(n - 1) : a, b = map(int, input().split()) a -= 1 b -= 1 hen[a].append(b) hen[b].append(a) subtree_dsum = [inv2 for i in range(n)] dfs0(0) dfs1(0) res = res * pow(2, n - 1, MOD) % MOD print(res)