結果

問題 No.1488 Max Score of the Tree
ユーザー H3PO4
提出日時 2022-07-30 09:04:06
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 506 ms / 2,000 ms
コード長 1,009 bytes
コンパイル時間 96 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 46,268 KB
最終ジャッジ日時 2024-07-20 04:29:23
合計ジャッジ時間 18,040 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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)))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0