結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | kit84 |
提出日時 | 2020-11-28 00:11:43 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,986 bytes |
コンパイル時間 | 278 ms |
コンパイル使用メモリ | 86,884 KB |
実行使用メモリ | 146,600 KB |
最終ジャッジ日時 | 2023-10-09 22:52:38 |
合計ジャッジ時間 | 26,770 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 120 ms
72,880 KB |
testcase_01 | AC | 121 ms
73,232 KB |
testcase_02 | WA | - |
testcase_03 | AC | 588 ms
126,660 KB |
testcase_04 | AC | 883 ms
145,876 KB |
testcase_05 | AC | 543 ms
128,288 KB |
testcase_06 | AC | 799 ms
138,676 KB |
testcase_07 | AC | 717 ms
134,128 KB |
testcase_08 | AC | 621 ms
127,548 KB |
testcase_09 | AC | 774 ms
136,128 KB |
testcase_10 | WA | - |
testcase_11 | AC | 791 ms
138,888 KB |
testcase_12 | AC | 790 ms
139,844 KB |
testcase_13 | AC | 727 ms
135,148 KB |
testcase_14 | AC | 764 ms
134,760 KB |
testcase_15 | AC | 744 ms
134,048 KB |
testcase_16 | AC | 872 ms
145,508 KB |
testcase_17 | AC | 744 ms
136,684 KB |
testcase_18 | AC | 691 ms
131,760 KB |
testcase_19 | AC | 807 ms
138,664 KB |
testcase_20 | AC | 797 ms
140,520 KB |
testcase_21 | AC | 737 ms
135,780 KB |
testcase_22 | AC | 816 ms
143,324 KB |
testcase_23 | AC | 738 ms
136,092 KB |
testcase_24 | AC | 821 ms
140,560 KB |
testcase_25 | AC | 863 ms
143,516 KB |
testcase_26 | AC | 719 ms
135,360 KB |
testcase_27 | AC | 802 ms
138,424 KB |
testcase_28 | AC | 620 ms
129,188 KB |
testcase_29 | WA | - |
testcase_30 | AC | 865 ms
142,340 KB |
testcase_31 | AC | 834 ms
143,504 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 779 ms
140,984 KB |
ソースコード
import sys input = sys.stdin.readline enum = enumerate inf = 1001001001002002002 MOD = 998244353 #10**9 + 7 import collections import random from bisect import bisect_right as bs_r from itertools import permutations import heapq def linput(ty=int, cvt=list): return cvt(map(ty,input().split())) def vinput(rep=1, ty=int, cvt=list): return cvt(ty(input().rstrip()) for _ in range(rep)) def gcd(a: int, b: int): while b: a, b = b, a%b return a def lcm(a: int, b: int): return a * b // gcd(a, b) def dist(x1,y1,x2,y2): return abs(x1-x2)+abs(y1-y2) vD = [chr(ord("a")+i) for i in range(26)] def bye(res): sT = "No Yes".split() print(sT[res]) #exit(0) def csum(v): vr = [0,] s = 0 for a in v: s = (s+a) vr.append(s) return vr def dijkstra(start, n, c_list): _vC = [inf,]*(n+1) _vC[start] = 0 _vR = [0,]*(n+1) #set({}) _vQ = [(0,start),] heapq.heapify(_vQ) while _vQ: _ci,_i = heapq.heappop(_vQ) if _vC[_i] < _ci: continue for _cj,_j,_m in c_list[_i]: if _vC[_j] > _vC[_i] + _cj: _vC[_j] = _vC[_i] + _cj #_vM |= {_m,} _vR[_j] = _i heapq.heappush(_vQ, (_vC[_j],_j)) return _vC, _vR def main(): N,M = linput() mT = [linput(int,tuple) for _ in range(M)] res = 0 # 1st graph mG = [[] for _ in range(N+1)] for m, (u,v,c,d) in enum(mT): mG[u].append( (c,v,m) ) mG[v].append( (c,u,m) ) # dijkstra 1 vC, vR = dijkstra(1, N, mG) #print(vC, vR)### res += vC[N] # find a path vM = set({}) vQ = [N,] while vQ: v = vQ.pop() u = vR[v] for c,gv,m in mG[u]: if gv==v: vQ.append(u) vM |= {m,} break # 2nd graph mG = [[] for _ in range(N+1)] for m, (u,v,c,d) in enum(mT): cost = d if m in vM else c mG[u].append( (cost,v,m) ) mG[v].append( (cost,u,m) ) # dijkstra 2 vC, vR = dijkstra(N, N, mG) #print(vC)### res += vC[1] print(res) if __name__ == "__main__": main()