結果

問題 No.2640 traO Stamps
ユーザー katonyonko
提出日時 2024-02-19 22:31:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 588 ms / 2,000 ms
コード長 2,656 bytes
コンパイル時間 187 ms
コンパイル使用メモリ 82,328 KB
実行使用メモリ 105,112 KB
最終ジャッジ日時 2024-09-29 02:23:27
合計ジャッジ時間 14,989 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math
_INPUT = """\
6
4 5 3
1 2 4 2
1 2 1
3 4 2
2 4 5
1 3 2
2 3 7
10
2 0 3
1 1 3
2 0 2
2 1 1
1 0 2
2 0 3
"""
INF=10**20
def WF(cost):
for k in range(len(cost)):
for i in range(len(cost)):
for j in range(len(cost)):
if cost[i][k]!=INF and cost[k][j]!=INF:
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])
return cost
class BIT:
def __init__(self, n):
self._n = n
self.data = [0] * n
def add(self, p, x):
assert 0 <= p < self._n
p += 1
while p <= self._n:
self.data[p - 1] += x
p += p & -p
#r
def sum(self, l, r):
assert 0 <= l <= r <= self._n
return self._sum(r) - self._sum(l)
def _sum(self, r):
s = 0
while r > 0:
s += self.data[r - 1]
r -= r & -r
return s
#px
def set(self, p, x):
self.add(p, -self.sum(p, p+1) + x)
def input():
return sys.stdin.readline()[:-1]
def solve(test):
N,M,K=map(int, input().split())
S=list(map(lambda x:int(x)-1, input().split()))
cost=[[INF]*N for _ in range(N)]
for i in range(N): cost[i][i]=0
for i in range(M):
a,b,c=map(int, input().split())
cost[a-1][b-1]=c
cost[b-1][a-1]=c
cost=WF(cost)
bit=BIT(K)
for i in range(K): bit.add(i,cost[S[i]][S[i+1]])
Q=int(input())
for _ in range(Q):
q=list(map(int, input().split()))
if q[0]==1:
a,b=q[1],q[2]-1
S[a]=b
if a<K: bit.set(a,cost[S[a]][S[a+1]])
if a>0: bit.set(a-1,cost[S[a-1]][S[a]])
else:
l,r=q[1],q[2]
print(bit.sum(l,r))
def random_input():
from random import randint,shuffle
N=randint(1,10)
M=randint(1,N)
A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
shuffle(A)
return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3
def simple_solve():
return []
def main(test):
if test==0:
solve(0)
elif test==1:
sys.stdin = io.StringIO(_INPUT)
case_no=int(input())
for _ in range(case_no):
solve(0)
else:
for i in range(1000):
sys.stdin = io.StringIO(random_input())
x=solve(1)
y=simple_solve()
if x!=y:
print(i,x,y)
print(*[line for line in sys.stdin],sep='')
break
#0:1:2:
main(0)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0