結果
問題 | No.2640 traO Stamps |
ユーザー |
![]() |
提出日時 | 2024-02-19 21:52:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 848 ms / 2,000 ms |
コード長 | 3,534 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 82,528 KB |
実行使用メモリ | 104,972 KB |
最終ジャッジ日時 | 2024-09-29 01:51:27 |
合計ジャッジ時間 | 22,515 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 33 |
ソースコード
class segtree():n=1size=1log=2d=[0]op=Nonee=10**15def __init__(self,V,OP,E):self.n=len(V)self.op=OPself.e=Eself.log=(self.n-1).bit_length()self.size=1<<self.logself.d=[E for i in range(2*self.size)]for i in range(self.n):self.d[self.size+i]=V[i]for i in range(self.size-1,0,-1):self.update(i)def set(self,p,x):assert 0<=p and p<self.np+=self.sizeself.d[p]=xfor i in range(1,self.log+1):self.update(p>>i)def get(self,p):assert 0<=p and p<self.nreturn self.d[p+self.size]def prod(self,l,r):assert 0<=l and l<=r and r<=self.nsml=self.esmr=self.el+=self.sizer+=self.sizewhile(l<r):if (l&1):sml=self.op(sml,self.d[l])l+=1if (r&1):smr=self.op(self.d[r-1],smr)r-=1l>>=1r>>=1return self.op(sml,smr)def all_prod(self):return self.d[1]def max_right(self,l,f):assert 0<=l and l<=self.nassert f(self.e)if l==self.n:return self.nl+=self.sizesm=self.ewhile(1):while(l%2==0):l>>=1if not(f(self.op(sm,self.d[l]))):while(l<self.size):l=2*lif f(self.op(sm,self.d[l])):sm=self.op(sm,self.d[l])l+=1return l-self.sizesm=self.op(sm,self.d[l])l+=1if (l&-l)==l:breakreturn self.ndef min_left(self,r,f):assert 0<=r and r<=self.nassert f(self.e)if r==0:return 0r+=self.sizesm=self.ewhile(1):r-=1while(r>1 and (r%2)):r>>=1if not(f(self.op(self.d[r],sm))):while(r<self.size):r=(2*r+1)if f(self.op(self.d[r],sm)):sm=self.op(self.d[r],sm)r-=1return r+1-self.sizesm=self.op(self.d[r],sm)if (r& -r)==r:breakreturn 0def update(self,k):self.d[k]=self.op(self.d[2*k],self.d[2*k+1])def __str__(self):return str([self.get(i) for i in range(self.n)])def add(x,y):return x + ydef Warshall_Floid(n,edge):INF = float("INF")dist = [ [INF for i in range(n)] for j in range(n)]for i in range(n):dist[i][i] = 0for u in range(n):for v,r in edge[u]:dist[u][v] = rfor k in range(n):for i in range(n):for j in range(n):dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j])return distdef Map():return list(map(int,input().split()))N,M,K = Map()S = Map()for i in range(K+1):S[i] -= 1G = [[] for i in range(N)]for i in range(M):A,B,C = Map()A -= 1B -= 1G[A].append((B,C))G[B].append((A,C))dist = Warshall_Floid(N,G)seg = segtree([0 for i in range(K+1)],add,0)for i in range(1,K+1):d = dist[S[i-1]][S[i]]seg.set(i,d)Q = int(input())for _ in range(Q):t,x,y = Map()if t == 1:y -= 1S[x] = yif x > 0:seg.set(x,dist[y][S[x-1]])if x < K:seg.set(x+1,dist[y][S[x+1]])else:print(seg.prod(x+1,y+1))