結果
問題 | No.1488 Max Score of the Tree |
ユーザー | H3PO4 |
提出日時 | 2022-07-30 09:04:06 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 177 ms / 2,000 ms |
コード長 | 1,009 bytes |
コンパイル時間 | 312 ms |
コンパイル使用メモリ | 10,880 KB |
実行使用メモリ | 32,804 KB |
最終ジャッジ日時 | 2023-09-27 10:20:19 |
合計ジャッジ時間 | 9,194 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 162 ms
32,732 KB |
testcase_01 | AC | 171 ms
32,672 KB |
testcase_02 | AC | 170 ms
32,596 KB |
testcase_03 | AC | 173 ms
32,788 KB |
testcase_04 | AC | 174 ms
32,784 KB |
testcase_05 | AC | 119 ms
29,820 KB |
testcase_06 | AC | 140 ms
31,800 KB |
testcase_07 | AC | 152 ms
32,112 KB |
testcase_08 | AC | 139 ms
32,152 KB |
testcase_09 | AC | 135 ms
30,604 KB |
testcase_10 | AC | 151 ms
32,260 KB |
testcase_11 | AC | 177 ms
32,804 KB |
testcase_12 | AC | 127 ms
30,284 KB |
testcase_13 | AC | 120 ms
30,188 KB |
testcase_14 | AC | 142 ms
32,000 KB |
testcase_15 | AC | 132 ms
31,812 KB |
testcase_16 | AC | 122 ms
31,012 KB |
testcase_17 | AC | 131 ms
31,464 KB |
testcase_18 | AC | 151 ms
31,920 KB |
testcase_19 | AC | 136 ms
31,948 KB |
testcase_20 | AC | 129 ms
30,628 KB |
testcase_21 | AC | 130 ms
31,696 KB |
testcase_22 | AC | 137 ms
30,812 KB |
testcase_23 | AC | 117 ms
29,796 KB |
testcase_24 | AC | 117 ms
29,744 KB |
testcase_25 | AC | 118 ms
29,816 KB |
testcase_26 | AC | 132 ms
32,592 KB |
testcase_27 | AC | 119 ms
30,092 KB |
testcase_28 | AC | 118 ms
30,104 KB |
testcase_29 | AC | 122 ms
30,660 KB |
testcase_30 | AC | 160 ms
32,308 KB |
testcase_31 | AC | 176 ms
32,708 KB |
ソースコード
import sys from collections import deque import numpy as np 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 = np.full(K + 1, -10 ** 9) dp[0] = 0 for a, b, c in edges: new_dp = dp.copy() value = c * (min(desc_leaves[a], desc_leaves[b])) new_dp[c:] = np.maximum(new_dp[c:], dp[:-c] + value) dp = new_dp print(dp.max() + sum(ds * l for ds, l in zip(dist, is_leaf)))