結果
問題 | No.1488 Max Score of the Tree |
ユーザー | H3PO4 |
提出日時 | 2022-07-30 08:47:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 224 ms / 2,000 ms |
コード長 | 1,016 bytes |
コンパイル時間 | 288 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 155,556 KB |
最終ジャッジ日時 | 2023-09-27 09:57:01 |
合計ジャッジ時間 | 7,274 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 211 ms
151,980 KB |
testcase_01 | AC | 213 ms
148,644 KB |
testcase_02 | AC | 220 ms
152,788 KB |
testcase_03 | AC | 217 ms
155,484 KB |
testcase_04 | AC | 224 ms
155,188 KB |
testcase_05 | AC | 93 ms
71,724 KB |
testcase_06 | AC | 132 ms
96,320 KB |
testcase_07 | AC | 171 ms
121,656 KB |
testcase_08 | AC | 147 ms
108,076 KB |
testcase_09 | AC | 139 ms
98,832 KB |
testcase_10 | AC | 167 ms
123,096 KB |
testcase_11 | AC | 215 ms
155,556 KB |
testcase_12 | AC | 99 ms
77,180 KB |
testcase_13 | AC | 115 ms
77,412 KB |
testcase_14 | AC | 150 ms
114,080 KB |
testcase_15 | AC | 139 ms
100,144 KB |
testcase_16 | AC | 110 ms
80,852 KB |
testcase_17 | AC | 123 ms
91,244 KB |
testcase_18 | AC | 180 ms
129,116 KB |
testcase_19 | AC | 145 ms
105,492 KB |
testcase_20 | AC | 124 ms
88,500 KB |
testcase_21 | AC | 113 ms
82,432 KB |
testcase_22 | AC | 136 ms
99,360 KB |
testcase_23 | AC | 92 ms
71,616 KB |
testcase_24 | AC | 94 ms
71,364 KB |
testcase_25 | AC | 93 ms
71,560 KB |
testcase_26 | AC | 128 ms
94,516 KB |
testcase_27 | AC | 106 ms
77,164 KB |
testcase_28 | AC | 117 ms
85,128 KB |
testcase_29 | AC | 118 ms
87,844 KB |
testcase_30 | AC | 193 ms
139,900 KB |
testcase_31 | AC | 222 ms
155,360 KB |
ソースコード
import sys from collections import deque input = sys.stdin.buffer.readline N, K = map(int, input().split()) edges = [] T = [[] for _ in range(N)] for _ in range(N - 1): a, b, c = map(int, input().split()) a -= 1 b -= 1 edges.append((a, b, c)) T[a].append((b, c)) T[b].append((a, c)) dist = [None] * N dist[0] = 0 d = deque([0]) dfs_order = [] is_leaf = [True] * N while d: v = d.pop() dv = dist[v] for x, c in T[v]: if dist[x] is None: dfs_order.append((v, x)) dist[x] = dv + c d.append(x) is_leaf[v] = False desc_leaves = [int(l) for l in is_leaf] for v, x in reversed(dfs_order): desc_leaves[v] += desc_leaves[x] dp = [-10 ** 9] * (K + 1) dp[0] = 0 for a, b, c in edges: new_dp = dp.copy() value = c * (min(desc_leaves[a], desc_leaves[b])) for i in range(K + 1 - c): new_dp[i + c] = max(new_dp[i + c], dp[i] + value) dp = new_dp print(max(dp) + sum(ds * l for ds, l in zip(dist, is_leaf)))