結果
問題 | No.1207 グラフX |
ユーザー |
|
提出日時 | 2020-08-30 17:00:00 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 10,505 bytes |
コンパイル時間 | 472 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 251,576 KB |
最終ジャッジ日時 | 2024-11-15 11:44:35 |
合計ジャッジ時間 | 47,198 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 WA * 1 |
other | AC * 9 WA * 37 |
ソースコード
import sys,bisect,string,math,time,functools,random,fractionsfrom heapq import heappush,heappop,heapifyfrom collections import deque,defaultdict,Counterfrom itertools import permutations,combinations,groupbyrep=range;R=rangedef Golf():n,*t=map(int,open(0).read().split())def I():return int(input())def S_():return input()def IS():return input().split()def LS():return [i for i in input().split()]def MI():return map(int,input().split())def LI():return [int(i) for i in input().split()]def LI_():return [int(i)-1 for i in input().split()]def NI(n):return [int(input()) for i in range(n)]def NI_(n):return [int(input())-1 for i in range(n)]def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]def StoLI():return [ord(i)-97 for i in input()]def ItoS(n):return chr(n+97)def LtoS(ls):return ''.join([chr(i+97) for i in ls])def RA():return map(int,open(0).read().split())def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]def RI(a=1,b=10):return random.randint(a,b)def Rtest(T):case,err=0,0for i in range(T):inp=INP()a1,ls=naive(*inp)a2=solve(*inp)if a1!=a2:print((a1,a2),inp)err+=1case+=1print('Tested',case,'case with',err,'errors')def GI(V,E,ls=None,Directed=False,index=1):org_inp=[];g=[[] for i in range(V)]FromStdin=True if ls==None else Falsefor i in range(E):if FromStdin:inp=LI()org_inp.append(inp)else:inp=ls[i]if len(inp)==2:a,b=inp;c=1else:a,b,c=inpif index==1:a-=1;b-=1aa=(a,c);bb=(b,c);g[a].append(bb)if not Directed:g[b].append(aa)return g,org_inpdef GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usagemp=[boundary]*(w+2);found={}for i in R(h):s=input()for char in search:if char in s:found[char]=((i+1)*(w+2)+s.index(char)+1)mp_def[char]=mp_def[replacement_of_found]mp+=[boundary]+[mp_def[j] for j in s]+[boundary]mp+=[boundary]*(w+2)return h+2,w+2,mp,founddef TI(n):return GI(n,n-1)def accum(ls):rt=[0]for i in ls:rt+=[rt[-1]+i]return rtdef bit_combination(n,base=2):rt=[]for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]return rtdef gcd(x,y):if y==0:return xif x%y==0:return ywhile x%y!=0:x,y=y,x%yreturn ydef YN(x):print(['NO','YES'][x])def Yn(x):print(['No','Yes'][x])def show(*inp,end='\n'):if show_flg:print(*inp,end=end)mo=10**9+7#mo=998244353inf=float('inf')FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))l_alp=string.ascii_lowercase#sys.setrecursionlimit(10**9)read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()class UnionFind:def __init__(self, n):# 負 : 根であることを示す。絶対値はランクを示す# 非負: 根でないことを示す。値は親を示すself.table = [-1] * ndef _root(self, x):if self.table[x] < 0:return xelse:# 経路の圧縮self.table[x] = self._root(self.table[x])return self.table[x]def find(self, x, y):return self._root(x) == self._root(y)def union(self, x, y):r1 = self._root(x)r2 = self._root(y)if r1 == r2:return# ランクの取得d1 = self.table[r1]d2 = self.table[r2]if d1 <= d2:self.table[r2] = r1if d1 == d2:self.table[r1] -= 1else:self.table[r1] = r2def __str__(self):rt=[i if j<0 else j for i,j in enumerate(self.table)]return str(rt)class Tree:def __init__(self,inp_size=None,ls=None,init=True,index=1):self.LCA_init_stat=Falseself.ETtable=[]if init:if ls==None:self.stdin(inp_size,index=index)else:self.node_size=len(ls)+1self.edges,_=GI(self.node_size,self.node_size-1,ls,index=index)returndef stdin(self,inp_size=None,index=1):if inp_size==None:self.node_size=int(input())else:self.node_size=inp_sizeself.edges,_=GI(self.node_size,self.node_size-1,index=index)returndef listin(self,ls,index=0):self.node_size=len(ls)+1self.edges,_=GI(self.node_size,self.node_size-1,ls,index=index)returndef dfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):q=deque([x])v=[None]*self.node_sizev[x]=root_vwhile q:c=q.pop()for nb,d in self.edges[c]:if v[nb]==None:q.append(nb)v[nb]=func(c,v[c],nb,d)return vdef bfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):q=deque([x])v=[None]*self.node_sizev[x]=root_vwhile q:c=q.popleft()for nb,d in self.edges[c]:if v[nb]==None:q.append(nb)v[nb]=func(c,v[c],nb,d)return vdef parent(self,x):return self.dfs(0,func=lambda pr,prv,nx,dist:pr,root_v=-1)def topological_sort(self,x): # return topological sort of the treetps=[]q=deque([x])v=[None]*self.node_sizev[x]=0while q:c=q.popleft()tps.append(c)for nb,d in self.edges[c]:if v[nb]==None:q.append(nb)v[nb]=0return tpsdef EulerTour(self,x):q=deque()q.append(x)self.depth=[None]*self.node_sizeself.depth[x]=0self.ETtable=[]self.ETdepth=[]self.ETin=[-1]*self.node_sizeself.ETout=[-1]*self.node_sizecnt=0while q:c=q.pop()if c<0:ce=~celse:ce=cfor nb,d in self.edges[ce]:if self.depth[nb]==None:q.append(~ce)q.append(nb)self.depth[nb]=self.depth[ce]+1self.ETtable.append(ce)self.ETdepth.append(self.depth[ce])if self.ETin[ce]==-1:self.ETin[ce]=cntelse:self.ETout[ce]=cntcnt+=1returndef doubling_LCA(self,root,x,y):if self.LCA_init_stat==False:self.depth=[None]*self.node_sizeself.depth=self.bfs(0,func=lambda pr,prv,nxt,dist:prv+1)self.par=self.bfs(0,func=lambda pr,prv,nxt,dist:pr)self.db=[self.par]for i in range(self.node_size.bit_length()):#show(self.db)self.db+=[[self.db[-1][self.db[-1][i]] for i in range(self.node_size)]]self.LCA_init_stat=Truedx=self.depth[x]dy=self.depth[y]if dx>dy:dx,dy=dy,dxc=self.node_size.bit_length()while c>0:if dx+c<=dy:x=self.db[c][x]dx+=1<<cc>>=1if x==y:return xc=self.node_size.bit_length()while c>0:if self.db[c][x]!=self.db[c][y]:x=self.db[c][x]y=self.db[c][y]c>>=1return self.par[x]def LCA_init(self,root):self.EulerTour(root)self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)#self.st=SegTree(self.node_size*2-1,self.ETdepth,function=min,ide=inf)self.LCA_init_stat=Truereturndef LCA(self,root,x,y):if self.LCA_init_stat==False:self.LCA_init(root)xin,xout=self.ETin[x],self.ETout[x]yin,yout=self.ETin[y],self.ETout[y]a=min(xin,yin)b=max(xout,yout,xin,yin)id_of_min_dep_in_et=self.st.query_id(a,b+1)return self.ETtable[id_of_min_dep_in_et]def __str__(self):return str(self.edges)def show(self):if all([all([d==1 for nd,d in e]) for e in self.edges]):print( [[nd for nd,d in e] for e in self.edges] )else:print(self)def dfs2(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):q=deque([x])v=[None]*self.node_sizev[x]=root_vdfs_tr=[x]while q:c=q.pop()for nb,d in self.edges[c]:if v[nb]==None:q.append(nb)v[nb]=func(c,v[c],nb,d)dfs_tr+=nb,return v,dfs_trshow_flg=Falseshow_flg=Trueans=0for i in range(1):ans=0n,m,x=LI()r=[]for i in range(m):a,b,c=LI_()c+=1r+=(c,(a,b)),g=[[]for i in range(n)]dc={}uf=UnionFind(n)r.sort(key=lambda x:-x[0])while r:c,(a,b)=r.pop()if uf._root(a)==uf._root(b):continueuf.union(a,b)dc[(a,b)]=cdc[(b,a)]=cg[a]+=b,g[b]+=a,def dfs(x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):q=deque([x])v=[None]*np=[-1]*nv[x]=root_vdfs_tr=[x]while q:c=q.pop()for nb in g[c]:if v[nb]==None:q.append(nb)v[nb]=func(c,v[c],nb,1)p[nb]=cdfs_tr+=nb,return v,dfs_tr,pv,dfs_tr,par=dfs(0)ch=[0]*nfor c in dfs_tr[::-1]:if par[c]==-1:continueif ch[c]==0:ch[c]=1ch[par[c]]+=ch[c]+1#ch[par[c]]+=ch[c]ans+=ch[c]*(n-ch[c])*pow(x,dc[(c,par[c])],mo)ans%=mo#show(c,ch[c],(n-ch[c]),pow(x,dc[(c,par[c])],mo),x)print(ans)