結果
| 問題 | No.1488 Max Score of the Tree |
| ユーザー |
 vwxyz
|
| 提出日時 | 2022-04-12 21:10:57 |
| 言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 7,264 bytes |
| コンパイル時間 | 306 ms |
| コンパイル使用メモリ | 13,440 KB |
| 実行使用メモリ | 30,536 KB |
| 最終ジャッジ日時 | 2024-12-21 06:50:52 |
| 合計ジャッジ時間 | 43,126 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | TLE | - |
| testcase_02 | TLE | - |
| testcase_03 | TLE | - |
| testcase_04 | TLE | - |
| testcase_05 | AC | 42 ms
12,544 KB |
| testcase_06 | AC | 738 ms
15,872 KB |
| testcase_07 | AC | 1,687 ms
16,640 KB |
| testcase_08 | AC | 1,040 ms
16,640 KB |
| testcase_09 | AC | 944 ms
13,952 KB |
| testcase_10 | AC | 1,536 ms
16,768 KB |
| testcase_11 | TLE | - |
| testcase_12 | AC | 59 ms
13,696 KB |
| testcase_13 | AC | 504 ms
13,184 KB |
| testcase_14 | AC | 1,491 ms
16,384 KB |
| testcase_15 | AC | 968 ms
15,232 KB |
| testcase_16 | AC | 184 ms
14,208 KB |
| testcase_17 | AC | 645 ms
15,104 KB |
| testcase_18 | TLE | - |
| testcase_19 | AC | 1,163 ms
16,896 KB |
| testcase_20 | AC | 474 ms
13,824 KB |
| testcase_21 | AC | 249 ms
15,232 KB |
| testcase_22 | AC | 859 ms
14,336 KB |
| testcase_23 | AC | 43 ms
12,288 KB |
| testcase_24 | AC | 43 ms
12,416 KB |
| testcase_25 | AC | 42 ms
12,416 KB |
| testcase_26 | AC | 618 ms
17,152 KB |
| testcase_27 | AC | 135 ms
12,800 KB |
| testcase_28 | AC | 308 ms
13,312 KB |
| testcase_29 | AC | 458 ms
13,696 KB |
| testcase_30 | TLE | - |
| testcase_31 | TLE | - |
ソースコード
import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
heap.append(item)
heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
if heap and item < heap[0]:
item, heap[0] = heap[0], item
heapq._siftup_max(heap, 0)
return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
class Graph:
def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float("inf")):
self.V=V
self.directed=directed
self.weighted=weighted
self.inf=inf
if graph:
self.graph=graph
self.edges=[]
for i in range(self.V):
if self.weighted:
for j,d in self.graph[i]:
if self.directed or not self.directed and i<=j:
self.edges.append((i,j,d))
else:
for j in self.graph[i]:
if self.directed or not self.directed and i<=j:
self.edges.append((i,j))
else:
self.edges=edges
self.graph=[[] for i in range(self.V)]
if weighted:
for i,j,d in self.edges:
self.graph[i].append((j,d))
if not self.directed:
self.graph[j].append((i,d))
else:
for i,j in self.edges:
self.graph[i].append(j)
if not self.directed:
self.graph[j].append(i)
def SIV_DFS(self,s,bipartite_graph=False,cycle_detection=False,directed_acyclic=False,euler_tour=False,linked_components=False,lowlink=False,parents=False,postorder=False,preorder=False,subtree_size=False,topological_sort=False,unweighted_dist=False,weighted_dist=False):
seen=[False]*self.V
finished=[False]*self.V
if directed_acyclic or cycle_detection or topological_sort:
dag=True
if euler_tour:
et=[]
if linked_components:
lc=[]
if lowlink:
order=[None]*self.V
ll=[None]*self.V
idx=0
if parents or cycle_detection or lowlink or subtree_size:
ps=[None]*self.V
if postorder or topological_sort:
post=[]
if preorder:
pre=[]
if subtree_size:
ss=[1]*self.V
if unweighted_dist or bipartite_graph:
uwd=[self.inf]*self.V
uwd[s]=0
if weighted_dist:
wd=[self.inf]*self.V
wd[s]=0
stack=[(s,0)] if self.weighted else [s]
while stack:
if self.weighted:
x,d=stack.pop()
else:
x=stack.pop()
if not seen[x]:
seen[x]=True
stack.append((x,d) if self.weighted else x)
if euler_tour:
et.append(x)
if linked_components:
lc.append(x)
if lowlink:
order[x]=idx
ll[x]=idx
idx+=1
if preorder:
pre.append(x)
for y in self.graph[x]:
if self.weighted:
y,d=y
if not seen[y]:
stack.append((y,d) if self.weighted else y)
if parents or cycle_detection or lowlink or subtree_size:
ps[y]=x
if unweighted_dist or bipartite_graph:
uwd[y]=uwd[x]+1
if weighted_dist:
wd[y]=wd[x]+d
elif not finished[y]:
if (directed_acyclic or cycle_detection or topological_sort) and dag:
dag=False
if cycle_detection:
cd=(y,x)
elif not finished[x]:
finished[x]=True
if euler_tour:
et.append(~x)
if lowlink:
bl=True
for y in self.graph[x]:
if self.weighted:
y,d=y
if ps[x]==y and bl:
bl=False
continue
ll[x]=min(ll[x],order[y])
if x!=s:
ll[ps[x]]=min(ll[ps[x]],ll[x])
if postorder or topological_sort:
post.append(x)
if subtree_size:
for y in self.graph[x]:
if self.weighted:
y,d=y
if y==ps[x]:
continue
ss[x]+=ss[y]
if bipartite_graph:
bg=[[],[]]
for tpl in self.edges:
x,y=tpl[:2] if self.weighted else tpl
if uwd[x]==self.inf or uwd[y]==self.inf:
continue
if not uwd[x]%2^uwd[y]%2:
bg=False
break
else:
for x in range(self.V):
if uwd[x]==self.inf:
continue
bg[uwd[x]%2].append(x)
retu=()
if bipartite_graph:
retu+=(bg,)
if cycle_detection:
if dag:
cd=[]
else:
y,x=cd
cd=self.Route_Restoration(y,x,ps)
retu+=(cd,)
if directed_acyclic:
retu+=(dag,)
if euler_tour:
retu+=(et,)
if linked_components:
retu+=(lc,)
if lowlink:
retu=(ll,)
if parents:
retu+=(ps,)
if postorder:
retu+=(post,)
if preorder:
retu+=(pre,)
if subtree_size:
retu+=(ss,)
if topological_sort:
if dag:
tp_sort=post[::-1]
else:
tp_sort=[]
retu+=(tp_sort,)
if unweighted_dist:
retu+=(uwd,)
if weighted_dist:
retu+=(wd,)
if len(retu)==1:
retu=retu[0]
return retu
N,K=map(int,readline().split())
edges=[]
for _ in range(N-1):
a,b,c=map(int,readline().split())
a-=1;b-=1
edges.append((a,b,c))
G=Graph(N,edges=edges,weighted=True)
parents,tour=G.SIV_DFS(0,parents=True,postorder=True)
size=[0]*N
for x in range(1,N):
if len(G.graph[x])==1:
size[x]=1
for x in tour[:-1]:
size[parents[x]]+=size[x]
ans=0
inf=1<<60
dp=[-inf]*(K+1)
dp[0]=0
for a,b,c in edges:
if parents[a]==b:
a,b=b,a
w=c*size[b]
ans+=w
for k in range(K,c-1,-1):
dp[k]=max(dp[k],dp[k-c]+w)
ans+=max(dp)
print(ans)