#586047 (PyPy3) No.1301 Strange Graph Shortest Path

• 問題: No.1301 Strange Graph Shortest Path
• ユーザー: kit84
• 提出日時: 2020-11-28 00:11:43
• 言語: PyPy3 (7.3.15)
• 結果: WA
• 実行時間: -
• コード長: 1,986 bytes
• コンパイル時間: 146 ms
• コンパイル使用メモリ: 82,448 KB
• 実行使用メモリ: 143,904 KB
• 最終ジャッジ日時: 2024-07-26 21:20:18
• 合計ジャッジ時間: 21,633 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 28 WA * 5

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
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()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX