結果
問題 | No.748 yuki国のお財布事情 |
ユーザー |
|
提出日時 | 2020-06-10 23:35:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 662 ms / 2,000 ms |
コード長 | 9,719 bytes |
コンパイル時間 | 181 ms |
コンパイル使用メモリ | 82,164 KB |
実行使用メモリ | 117,184 KB |
最終ジャッジ日時 | 2024-06-23 19:39:31 |
合計ジャッジ時間 | 10,630 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
import sys,bisect,string,math,time,functools,random,fractionsfrom heapq import heappush,heappop,heapifyfrom collections import deque,defaultdict,Counterfrom itertools import permutations,combinations,groupbyrep=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 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 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 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 range(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 range(base**n):s=[tb//(base**bt)%base for bt in range(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 show(*inp,end='\n'):if show_flg:print(*inp,end=end)YN=['YES','NO'];Yn=['Yes','No']mo=10**9+7inf=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**7)read=sys.stdin.buffer.readreadline=sys.stdin.buffer.readlineinput=lambda: sys.stdin.readline().rstrip()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.size=len(ls)+1self.edges,_=GI(self.size,self.size-1,ls,index=index)returndef stdin(self,inp_size=None,index=1):if inp_size==None:self.size=int(input())else:self.size=inp_sizeself.edges,_=GI(self.size,self.size-1,index=index)returndef listin(self,ls,index=0):self.size=len(ls)+1self.edges,_=GI(self.size,self.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.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.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.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.sizeself.depth[x]=0self.ETtable=[]self.ETdepth=[]self.ETin=[-1]*self.sizeself.ETout=[-1]*self.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 LCA_init(self,root):self.EulerTour(root)self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)#self.st=SegTree(self.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 edge]) for edge in self.edges]):print( [[nd for nd,d in edge] for edge in self.edges] )else:print(self)class SparseTable: # O(N log N) for init, O(1) for query(l,r)def __init__(self,ls,init_func=min,init_idl=float('inf')):self.func=init_funcself.idl=init_idlself.size=len(ls)self.N0=self.size.bit_length()self.table=[ls[:]]self.index=[list(range(self.size))]self.lg=[0]*(self.size+1)for i in range(2,self.size+1):self.lg[i]=self.lg[i>>1]+1for i in range(self.N0):tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]self.table+=[tmp]self.index+=[tmp_id]# return func of [l,r)def query(self,l,r):if r>self.size:r=self.size#N=(r-l).bit_length()-1N=self.lg[r-l]return self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))])# return index of which val[i] = func of v among [l,r)def query_id(self,l,r):if r>self.size:r=self.size#N=(r-l).bit_length()-1N=self.lg[r-l]a,b=self.index[N][l],self.index[N][max(0,r-(1<<N))]if self.table[0][a]==self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))]):b=areturn b# return boundary index of r such that func({table[i]} =< x , i in [pos,r]def right_bound(self,pos,x):k=(self.size-pos).bit_length()for j in range(k)[::-1]:nx=pos+(1<<j)if nx<n and self.query(pos,nx+1)<=x:pos+=(1<<j)return pos# return boundary index of l such that func({table[i]} =< x , i in [l,pos]def left_bound(self,pos,x):k=pos.bit_length()for j in range(k)[::-1]:nx=pos-(1<<j)if 0<=nx and self.query(nx,pos+1)<=x:pos-=(1<<j)return posdef __str__(self):return str(self.table[0])def print(self):for i in self.table:print(*i)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)show_flg=Falseshow_flg=Trueans=0n,m,k=LI()e=[]for i in range(m):a,b,c=LI_()c+=1e+=[(c,(a,b))]f=set(NI_(k))uf=UnionFind(n)g=[]for i in range(m):c,(a,b)=e[i]if i in f:uf.union(a,b)else:g+=[(c,(a,b))]heapify(g)while g:c,(a,b)=heappop(g)if uf._root(a)==uf._root(b):ans+=celse:uf.union(a,b)print(ans)