結果
問題 | No.828 全方位神童数 |
ユーザー |
![]() |
提出日時 | 2024-04-08 08:39:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 841 ms / 2,000 ms |
コード長 | 10,493 bytes |
コンパイル時間 | 373 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 174,356 KB |
最終ジャッジ日時 | 2024-10-01 04:59:42 |
合計ジャッジ時間 | 23,212 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
ソースコード
from collections import defaultdictclass UnionFind:def __init__(self,N,label=None,f=None,weighted=False,rollback=False):self.N=Nself.parents=[None]*self.Nself.size=[1]*self.Nself.roots={i for i in range(self.N)}self.label=labelif self.label!=None:self.label=[x for x in label]self.f=fself.weighted=weightedif self.weighted:self.weight=[0]*self.Nself.rollback=rollbackif self.rollback:self.operate_list=[]self.operate_set=[]def Find(self,x):stack=[]while self.parents[x]!=None:stack.append(x)x=self.parents[x]if not self.rollback:if self.weighted:w=0for y in stack[::-1]:self.parents[y]=xw+=self.weight[y]self.weight[y]=welse:for y in stack[::-1]:self.parents[y]=xreturn xdef Union(self,x,y,w=None):root_x=self.Find(x)root_y=self.Find(y)if self.rollback:self.operate_list.append([])self.operate_set.append([])if root_x==root_y:if self.weighted:if self.weight[y]-self.weight[x]==w:return Trueelse:return Falseelse:if self.size[root_x]<self.size[root_y]:x,y=y,xroot_x,root_y=root_y,root_xif self.weighted:w=-wif self.rollback:self.operate_list[-1].append((self.parents,root_y,self.parents[root_y]))self.operate_list[-1].append((self.size,root_x,self.size[root_x]))self.operate_set[-1].append(root_y)if self.label!=None:self.operate_list[-1]((self.label,root_x,self.label[root_x]))if self.weighted:self.operate_list[-1].append((self.weight,root_y,self.weight[root_y]))self.parents[root_y]=root_xself.size[root_x]+=self.size[root_y]self.roots.remove(root_y)if self.label!=None:self.label[root_x]=self.f(self.label[root_x],self.label[root_y])if self.weighted:self.weight[root_y]=w+self.weight[x]-self.weight[y]def Size(self,x):return self.size[self.Find(x)]def Same(self,x,y):return self.Find(x)==self.Find(y)def Label(self,x):return self.label[self.Find(x)]def Weight(self,x,y):root_x=self.Find(x)root_y=self.Find(y)if root_x!=root_y:return Nonereturn self.weight[y]-self.weight[x]def Roots(self):return list(self.roots)def Linked_Components_Count(self):return len(self.roots)def Linked_Components(self):linked_components=defaultdict(list)for x in range(self.N):linked_components[self.Find(x)].append(x)return linked_componentsdef Rollback(self):assert self.rollbackif self.operate_list:for lst,x,v in self.operate_list.pop():lst[x]=vfor x in self.operate_set.pop():self.roots.add(x)return Trueelse:return Falsedef __str__(self):linked_components=defaultdict(list)for x in range(self.N):linked_components[self.Find(x)].append(x)return "\n".join(f"{r}: {linked_components[r]}" for r in sorted(list(linked_components.keys())))class Graph:def __init__(self,V,edges=None,graph=None,directed=False,weighted=False,inf=float("inf")):self.V=Vself.directed=directedself.weighted=weightedself.inf=infif 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=edgesself.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.Vfinished=[False]*self.Vif directed_acyclic or cycle_detection or topological_sort:dag=Trueif euler_tour:et=[]if linked_components:lc=[]if lowlink:order=[None]*self.Vll=[None]*self.Vidx=0if parents or cycle_detection or lowlink or subtree_size:ps=[None]*self.Vif postorder or topological_sort:post=[]if preorder:pre=[]if subtree_size:ss=[1]*self.Vif unweighted_dist or bipartite_graph:uwd=[self.inf]*self.Vuwd[s]=0if weighted_dist:wd=[self.inf]*self.Vwd[s]=0stack=[(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]=Truestack.append((x,d) if self.weighted else x)if euler_tour:et.append(x)if linked_components:lc.append(x)if lowlink:order[x]=idxll[x]=idxidx+=1if preorder:pre.append(x)for y in self.graph[x]:if self.weighted:y,d=yif not seen[y]:stack.append((y,d) if self.weighted else y)if parents or cycle_detection or lowlink or subtree_size:ps[y]=xif unweighted_dist or bipartite_graph:uwd[y]=uwd[x]+1if weighted_dist:wd[y]=wd[x]+delif not finished[y]:if (directed_acyclic or cycle_detection or topological_sort) and dag:dag=Falseif cycle_detection:cd=(y,x)elif not finished[x]:finished[x]=Trueif euler_tour:et.append(~x)if lowlink:bl=Truefor y in self.graph[x]:if self.weighted:y,d=yif ps[x]==y and bl:bl=Falsecontinuell[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=yif y==ps[x]:continuess[x]+=ss[y]if bipartite_graph:bg=[[],[]]for tpl in self.edges:x,y=tpl[:2] if self.weighted else tplif uwd[x]==self.inf or uwd[y]==self.inf:continueif not uwd[x]%2^uwd[y]%2:bg=Falsebreakelse:for x in range(self.V):if uwd[x]==self.inf:continuebg[uwd[x]%2].append(x)retu=()if bipartite_graph:retu+=(bg,)if cycle_detection:if dag:cd=[]else:y,x=cdcd=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 retuN=int(input())R=list(map(int,input().split()))graph=[[] for x in range(N)]for i in range(N-1):u,v=map(int,input().split())u-=1;v-=1if u>v:u,v=v,ugraph[v].append(u)cnt=[0]*NUF=UnionFind(N,label=[x for x in range(N)],f=max)edges=[]for x in range(N):for y in graph[x]:edges.append((UF.Label(x),UF.Label(y)))UF.Union(x,y)cnt[UF.Label(x)]+=1G=Graph(N,edges=edges)parents,tour=G.SIV_DFS(UF.Label(N-1),parents=True,preorder=True)for x in tour:for y in G.graph[x]:if y==parents[x]:continuecnt[y]+=cnt[x]ans=1mod=10**9+7for x in range(N):ans*=R[x]+cnt[x]ans%=modprint(ans)