結果
問題 | No.1333 Squared Sum |
ユーザー | maspy |
提出日時 | 2021-01-08 21:45:44 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 987 ms / 2,000 ms |
コード長 | 1,499 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 87,172 KB |
実行使用メモリ | 154,192 KB |
最終ジャッジ日時 | 2023-08-10 09:43:37 |
合計ジャッジ時間 | 27,753 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
71,180 KB |
testcase_01 | AC | 70 ms
71,180 KB |
testcase_02 | AC | 67 ms
71,164 KB |
testcase_03 | AC | 987 ms
153,840 KB |
testcase_04 | AC | 947 ms
154,192 KB |
testcase_05 | AC | 969 ms
153,772 KB |
testcase_06 | AC | 978 ms
154,080 KB |
testcase_07 | AC | 940 ms
154,072 KB |
testcase_08 | AC | 949 ms
153,956 KB |
testcase_09 | AC | 947 ms
153,848 KB |
testcase_10 | AC | 978 ms
153,940 KB |
testcase_11 | AC | 946 ms
152,344 KB |
testcase_12 | AC | 953 ms
153,680 KB |
testcase_13 | AC | 773 ms
154,004 KB |
testcase_14 | AC | 960 ms
153,660 KB |
testcase_15 | AC | 954 ms
153,944 KB |
testcase_16 | AC | 71 ms
71,392 KB |
testcase_17 | AC | 69 ms
71,380 KB |
testcase_18 | AC | 68 ms
71,312 KB |
testcase_19 | AC | 70 ms
70,988 KB |
testcase_20 | AC | 69 ms
70,964 KB |
testcase_21 | AC | 68 ms
71,340 KB |
testcase_22 | AC | 69 ms
71,316 KB |
testcase_23 | AC | 68 ms
71,304 KB |
testcase_24 | AC | 69 ms
71,372 KB |
testcase_25 | AC | 68 ms
71,256 KB |
testcase_26 | AC | 979 ms
153,252 KB |
testcase_27 | AC | 973 ms
153,204 KB |
testcase_28 | AC | 965 ms
153,356 KB |
testcase_29 | AC | 822 ms
154,116 KB |
testcase_30 | AC | 502 ms
108,284 KB |
testcase_31 | AC | 339 ms
94,208 KB |
testcase_32 | AC | 640 ms
123,628 KB |
testcase_33 | AC | 556 ms
111,676 KB |
testcase_34 | AC | 818 ms
138,480 KB |
testcase_35 | AC | 665 ms
123,808 KB |
testcase_36 | AC | 451 ms
103,280 KB |
testcase_37 | AC | 454 ms
104,252 KB |
testcase_38 | AC | 532 ms
108,188 KB |
testcase_39 | AC | 721 ms
129,220 KB |
testcase_40 | AC | 462 ms
148,844 KB |
testcase_41 | AC | 465 ms
148,084 KB |
testcase_42 | AC | 446 ms
148,620 KB |
testcase_43 | AC | 449 ms
148,180 KB |
ソースコード
import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines MOD = 1_000_000_007 def bfs_tree(N, G, root=1): q = [root] parent = [0] * (N + 1) dist = [0] * (N + 1) for v in q: for w, cost in G[v]: if w == parent[v]: continue dist[w] = dist[v] + cost parent[w] = v q.append(w) return parent, q, dist def main(N, G): parent, order, dist = bfs_tree(N, G) ans = 0 # k 乗和 dp_0 = [0] * (N + 1) dp_1 = [0] * (N + 1) dp_2 = [0] * (N + 1) dp = [0] * (N + 1) # lca ごとの答 for v in order[::-1]: dp_0[v] += 1 dp[v] += dp_2[v] * dp_0[v] * 2 dp[v] += 2 * dp_1[v]**2 dp_0[v] %= MOD dp_1[v] %= MOD dp_2[v] %= MOD dp[v] %= MOD p = parent[v] if p == 0: break d = dist[v] - dist[p] dp[p] -= dp_0[v] * dp_2[v] * 2 + 4 * d * d * dp_0[v]**2 dp[p] -= 2 * dp_1[v] * dp_1[v] dp[p] -= 8 * d * dp_0[v] * dp_1[v] dp_0[p] += dp_0[v] dp_1[p] += dp_1[v] + d * dp_0[v] dp_2[p] += dp_2[v] + 2 * d * dp_1[v] + d * d * dp_0[v] ans = sum(dp) % MOD if ans & 1: ans += MOD ans //= 2 return ans N = int(readline()) G = [[] for _ in range(N + 1)] for line in readlines(): a, b, c = map(int, line.split()) G[a].append((b, c)) G[b].append((a, c)) print(main(N, G))