結果
問題 | No.1002 Twotone |
ユーザー |
![]() |
提出日時 | 2024-07-17 14:23:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,976 ms / 5,000 ms |
コード長 | 9,383 bytes |
コンパイル時間 | 475 ms |
コンパイル使用メモリ | 82,156 KB |
実行使用メモリ | 357,280 KB |
最終ジャッジ日時 | 2024-07-17 14:25:19 |
合計ジャッジ時間 | 79,931 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
55,552 KB |
testcase_01 | AC | 44 ms
55,552 KB |
testcase_02 | AC | 45 ms
55,552 KB |
testcase_03 | AC | 2,422 ms
284,588 KB |
testcase_04 | AC | 3,146 ms
299,284 KB |
testcase_05 | AC | 3,146 ms
289,964 KB |
testcase_06 | AC | 59 ms
66,304 KB |
testcase_07 | AC | 1,861 ms
264,472 KB |
testcase_08 | AC | 3,208 ms
336,732 KB |
testcase_09 | AC | 3,162 ms
357,280 KB |
testcase_10 | AC | 68 ms
69,760 KB |
testcase_11 | AC | 3,099 ms
271,104 KB |
testcase_12 | AC | 4,038 ms
295,000 KB |
testcase_13 | AC | 4,100 ms
317,328 KB |
testcase_14 | AC | 58 ms
64,896 KB |
testcase_15 | AC | 2,363 ms
273,272 KB |
testcase_16 | AC | 4,187 ms
300,944 KB |
testcase_17 | AC | 4,141 ms
301,928 KB |
testcase_18 | AC | 88 ms
77,184 KB |
testcase_19 | AC | 3,903 ms
281,016 KB |
testcase_20 | AC | 4,750 ms
355,008 KB |
testcase_21 | AC | 4,507 ms
353,536 KB |
testcase_22 | AC | 104 ms
77,176 KB |
testcase_23 | AC | 2,905 ms
273,284 KB |
testcase_24 | AC | 4,976 ms
347,808 KB |
testcase_25 | AC | 4,919 ms
344,636 KB |
testcase_26 | AC | 48 ms
56,960 KB |
testcase_27 | AC | 652 ms
208,100 KB |
testcase_28 | AC | 1,325 ms
274,652 KB |
testcase_29 | AC | 1,104 ms
273,896 KB |
testcase_30 | AC | 45 ms
56,320 KB |
testcase_31 | AC | 1,100 ms
275,108 KB |
testcase_32 | AC | 1,384 ms
274,320 KB |
testcase_33 | AC | 1,180 ms
274,228 KB |
testcase_34 | AC | 4,597 ms
345,604 KB |
ソースコード
from collections import defaultdict 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 def Centroid(self,root=0): x=root parents,size=self.SIV_DFS(x,parents=True,subtree_size=True) while True: for y in self.graph[x]: if self.weighted: y,d=y if y==parents[x]: continue if size[y]*2>size[root]: x=y break else: for y in self.graph[x]: if self.weighted: y,d=y if y==parents[x]: continue if size[root]<=2*size[y]: return x,y return x,None def Centroid_Decomposition(self): E=self.edges P=[i for i in range(self.V)] prev_centroid=None stack=[(E,P,prev_centroid)] ans=0 while stack: E,P,prev_centroid=stack.pop() if len(P)==1: centroid=P[0] continue G=Graph(len(P),edges=E,weighted=self.weighted) centroid,_=G.Centroid() parents,tour=G.SIV_DFS(centroid,parents=True,preorder=True) dp=[None]*len(P) dp_C=[None]*len(P) dp_C[centroid]=tuple() EE=[] PP=[] for i,x in enumerate(G.graph[centroid]): if G.weighted: x,d=x dp[x]=(i,0) EE.append([]) PP.append([P[x]]) dp_C[x]=(d,) for x in tour[1:]: for y in G.graph[x]: if G.weighted: y,d=y if y==parents[x]: continue i,j=dp[x] jj=len(PP[i]) EE[i].append((j,jj,d)) PP[i].append(P[y]) dp[y]=(i,jj) if len(dp_C[x])>=3 or d in dp_C[x]: dp_C[y]=dp_C[x] else: dp_C[y]=dp_C[x]+(d,) tpls=[] dct=[[] for i in range(len(P))] for p,c in zip(dp,dp_C): if p==None: continue dct[p[0]].append(c) tpls.append(c) if len(c)==2: ans+=1 ans+=cnt(tpls) for lst in dct: ans-=cnt(lst) centroid=P[centroid] for E,P in zip(EE,PP): stack.append((E,P,centroid)) return ans def cnt(dp_C): cnt1=defaultdict(int) cnt2=defaultdict(int) c1=0 for tpl in dp_C: if len(tpl)==1: cnt1[tpl[0]]+=1 c1+=1 elif len(tpl)==2: a,b=tpl if a>b: a,b=b,a cnt2[(a,b)]+=1 retu=0 retu+=c1*(c1-1)//2 for c in cnt1.values(): retu-=c*(c-1)//2 for (a,b),c in cnt2.items(): retu+=c*(c-1)//2 retu+=(cnt1[a]+cnt1[b])*c return retu N,K=map(int,input().split()) edges=[] for i in range(N-1): u,v,c=map(int,input().split()) u-=1;v-=1 edges.append((u,v,c)) G=Graph(N,edges=edges,weighted=True) ans=G.Centroid_Decomposition() print(ans)