結果
| 問題 | No.1103 Directed Length Sum |
| ユーザー |
 vwxyz
|
| 提出日時 | 2024-07-17 11:00:11 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,376 bytes |
| コンパイル時間 | 161 ms |
| コンパイル使用メモリ | 82,424 KB |
| 実行使用メモリ | 385,076 KB |
| 最終ジャッジ日時 | 2024-07-17 11:00:38 |
| 合計ジャッジ時間 | 25,222 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 37 ms
53,388 KB |
| testcase_01 | AC | 37 ms
52,884 KB |
| testcase_02 | WA | - |
| testcase_03 | AC | 1,189 ms
385,076 KB |
| testcase_04 | AC | 1,648 ms
218,688 KB |
| testcase_05 | TLE | - |
| testcase_06 | AC | 1,025 ms
164,856 KB |
| testcase_07 | AC | 263 ms
95,100 KB |
| testcase_08 | AC | 389 ms
107,104 KB |
| testcase_09 | AC | 203 ms
88,284 KB |
| testcase_10 | AC | 484 ms
118,060 KB |
| testcase_11 | AC | 1,729 ms
233,524 KB |
| testcase_12 | AC | 976 ms
164,212 KB |
| testcase_13 | AC | 548 ms
120,668 KB |
| testcase_14 | AC | 168 ms
85,396 KB |
| testcase_15 | AC | 808 ms
143,200 KB |
| testcase_16 | AC | 1,948 ms
255,288 KB |
| testcase_17 | AC | 2,129 ms
261,116 KB |
| testcase_18 | AC | 510 ms
117,928 KB |
| testcase_19 | AC | 1,716 ms
236,252 KB |
| testcase_20 | AC | 203 ms
88,552 KB |
| testcase_21 | AC | 333 ms
103,872 KB |
| testcase_22 | AC | 1,454 ms
204,732 KB |
| testcase_23 | AC | 872 ms
150,648 KB |
ソースコード
class Graph:
def __init__(self,V,edges=None,graph=None,directed=False,weighted=False,inf=float("inf")):
self.V=V
self.directed=directed
self.weighted=weighted
self.inf=inf
if graph!=None:
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(input())
degree=[0]*N
edges=[]
for i in range(N-1):
A,B=map(int,input().split())
A-=1;B-=1
edges.append((A,B))
degree[B]+=1
r=degree.index(0)
G=Graph(N,edges=edges)
size,depth=G.SIV_DFS(r,subtree_size=True,unweighted_dist=True)
ans=0
for A,B in edges:
ans+=size[B]*(depth[A]+1)
print(ans)