結果
| 問題 | No.763 Noelちゃんと木遊び |
| ユーザー |
 vwxyz
|
| 提出日時 | 2022-05-04 01:04:00 |
| 言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
| 結果 |
AC
|
| 実行時間 | 649 ms / 2,000 ms |
| コード長 | 6,535 bytes |
| コンパイル時間 | 79 ms |
| コンパイル使用メモリ | 11,308 KB |
| 実行使用メモリ | 41,668 KB |
| 最終ジャッジ日時 | 2023-09-15 23:08:41 |
| 合計ジャッジ時間 | 10,767 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 523 ms
41,668 KB |
| testcase_01 | AC | 210 ms
17,708 KB |
| testcase_02 | AC | 512 ms
29,716 KB |
| testcase_03 | AC | 348 ms
23,028 KB |
| testcase_04 | AC | 246 ms
19,112 KB |
| testcase_05 | AC | 327 ms
22,656 KB |
| testcase_06 | AC | 636 ms
34,108 KB |
| testcase_07 | AC | 600 ms
33,120 KB |
| testcase_08 | AC | 352 ms
23,728 KB |
| testcase_09 | AC | 225 ms
18,808 KB |
| testcase_10 | AC | 94 ms
12,740 KB |
| testcase_11 | AC | 649 ms
34,572 KB |
| testcase_12 | AC | 559 ms
31,604 KB |
| testcase_13 | AC | 573 ms
31,352 KB |
| testcase_14 | AC | 494 ms
28,844 KB |
| testcase_15 | AC | 343 ms
22,888 KB |
| testcase_16 | AC | 67 ms
11,224 KB |
| testcase_17 | AC | 345 ms
23,028 KB |
| testcase_18 | AC | 649 ms
34,192 KB |
| testcase_19 | AC | 579 ms
31,924 KB |
| testcase_20 | AC | 581 ms
31,944 KB |
ソースコード
import sys
readline=sys.stdin.readline
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=int(readline())
edges=[]
for _ in range(N-1):
U,V=map(int,readline().split())
U-=1;V-=1
edges.append((U,V))
G=Graph(N,edges=edges)
parents,tour=G.SIV_DFS(0,parents=True,postorder=True)
dp0,dp1=[0]*N,[0]*N
for x in tour:
dp0[x]=sum(max(dp0[y],dp1[y]) for y in G.graph[x] if y!=parents[x])
dp1[x]=max(sum(max(dp0[y],dp1[y]-1) for y in G.graph[x] if y!=parents[x]),sum(dp0[y] for y in G.graph[x] if y!=parents[x])+1)
ans=max(dp0[0],dp1[0])
print(ans)