結果
問題 | No.1333 Squared Sum |
ユーザー | maspy |
提出日時 | 2021-01-08 22:01:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 902 ms / 2,000 ms |
コード長 | 1,499 bytes |
コンパイル時間 | 232 ms |
コンパイル使用メモリ | 82,276 KB |
実行使用メモリ | 153,532 KB |
最終ジャッジ日時 | 2024-04-28 03:01:27 |
合計ジャッジ時間 | 21,626 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
52,332 KB |
testcase_01 | AC | 34 ms
53,928 KB |
testcase_02 | AC | 34 ms
53,128 KB |
testcase_03 | AC | 783 ms
153,532 KB |
testcase_04 | AC | 778 ms
152,628 KB |
testcase_05 | AC | 902 ms
152,892 KB |
testcase_06 | AC | 843 ms
152,908 KB |
testcase_07 | AC | 768 ms
152,888 KB |
testcase_08 | AC | 779 ms
152,896 KB |
testcase_09 | AC | 766 ms
153,024 KB |
testcase_10 | AC | 791 ms
152,892 KB |
testcase_11 | AC | 774 ms
149,960 KB |
testcase_12 | AC | 766 ms
152,636 KB |
testcase_13 | AC | 643 ms
153,288 KB |
testcase_14 | AC | 754 ms
153,392 KB |
testcase_15 | AC | 771 ms
153,388 KB |
testcase_16 | AC | 31 ms
53,236 KB |
testcase_17 | AC | 31 ms
53,876 KB |
testcase_18 | AC | 31 ms
52,756 KB |
testcase_19 | AC | 32 ms
53,252 KB |
testcase_20 | AC | 31 ms
53,876 KB |
testcase_21 | AC | 30 ms
52,752 KB |
testcase_22 | AC | 30 ms
53,076 KB |
testcase_23 | AC | 31 ms
52,908 KB |
testcase_24 | AC | 31 ms
53,228 KB |
testcase_25 | AC | 32 ms
52,932 KB |
testcase_26 | AC | 770 ms
152,180 KB |
testcase_27 | AC | 765 ms
152,576 KB |
testcase_28 | AC | 774 ms
152,448 KB |
testcase_29 | AC | 655 ms
152,652 KB |
testcase_30 | AC | 372 ms
106,412 KB |
testcase_31 | AC | 259 ms
93,568 KB |
testcase_32 | AC | 494 ms
123,452 KB |
testcase_33 | AC | 412 ms
109,320 KB |
testcase_34 | AC | 627 ms
138,172 KB |
testcase_35 | AC | 499 ms
123,200 KB |
testcase_36 | AC | 335 ms
102,212 KB |
testcase_37 | AC | 341 ms
103,744 KB |
testcase_38 | AC | 392 ms
107,136 KB |
testcase_39 | AC | 535 ms
128,264 KB |
testcase_40 | AC | 356 ms
148,148 KB |
testcase_41 | AC | 352 ms
149,548 KB |
testcase_42 | AC | 347 ms
148,556 KB |
testcase_43 | AC | 344 ms
148,080 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))