提出 #74603211

---

ソースコード 拡げる

import bisect, heapq, sys, math, copy, itertools, decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10**7)
def INT(): return int(input())
def MI(d=0): return map(lambda x:int(x)+d, input().split())
def MS(): return map(str, input().split())
def LI(d=0): return list(map(lambda x:int(x)+d, input().split()))
def LS(): return list(map(str, input().split()))
def pr_line(itr): print(*itr, sep='\n')
def pr_mtx(matrix): [print(*row) for row in matrix] 
dij = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dij2 = [[1, 0], [0, 1], [-1, 0], [0, -1], [1, 1], [1, -1], [-1, 1], [-1, -1]]
INF = float('inf')

N, M = MI()

G = [[] for _ in range(N)]

for _ in range(M):
    u, v, c = MI(-1)
    c += 1
    G[u].append((v, c))

Q = [(0, 0)]
heapq.heapify(Q)
dist = [-1]*N

while Q:
    d, u = heapq.heappop(Q)
    if dist[u] != -1:
        continue
    dist[u] = d
    for v, c in G[u]:
        nd = d + c
        if dist[v] == -1:
            heapq.heappush(Q, (nd, v))
print(dist[-1])

提出情報

ジャッジ結果