提出 #74602405

ソースコード 拡げる

import heapq

N, M = map(int, input().split())

graph = [[] for _ in range(N + 1)]

for _ in range(M):
    u, v, c = map(int, input().split())
    graph[u].append((v, c))

INF = 10**18
dist = [INF] * (N + 1)
dist[1] = 0

pq = [(0, 1)]  # (distance, node)

while pq:
    d, u = heapq.heappop(pq)
    
    if d > dist[u]:
        continue
    
    for v, cost in graph[u]:
        if dist[v] > d + cost:
            dist[v] = d + cost
            heapq.heappush(pq, (dist[v], v))

print(dist[N])

提出情報

提出日時
問題 D - 最速配達ルート
ユーザ RishindhikaP
言語 Python (CPython 3.13.7)
得点 400
コード長 522 Byte
結果 AC
実行時間 634 ms
メモリ 56392 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 85
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt, in76.txt, in77.txt, in78.txt, in79.txt, in80.txt, in81.txt, in82.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 12 ms 9320 KiB
in02.txt AC 13 ms 9576 KiB
in03.txt AC 17 ms 9820 KiB
in04.txt AC 15 ms 9696 KiB
in05.txt AC 11 ms 9320 KiB
in06.txt AC 12 ms 9304 KiB
in07.txt AC 263 ms 35160 KiB
in08.txt AC 13 ms 9444 KiB
in09.txt AC 533 ms 50392 KiB
in10.txt AC 19 ms 10096 KiB
in11.txt AC 518 ms 49544 KiB
in12.txt AC 550 ms 50596 KiB
in13.txt AC 267 ms 37600 KiB
in14.txt AC 263 ms 37540 KiB
in15.txt AC 335 ms 36872 KiB
in16.txt AC 265 ms 37564 KiB
in17.txt AC 328 ms 36824 KiB
in18.txt AC 611 ms 56392 KiB
in19.txt AC 634 ms 51672 KiB
in20.txt AC 331 ms 35576 KiB
in21.txt AC 472 ms 42328 KiB
in22.txt AC 474 ms 49508 KiB
in23.txt AC 503 ms 45536 KiB
in24.txt AC 534 ms 48804 KiB
in25.txt AC 604 ms 49368 KiB
in26.txt AC 488 ms 42328 KiB
in27.txt AC 11 ms 9312 KiB
in28.txt AC 165 ms 37540 KiB
in29.txt AC 12 ms 9252 KiB
in30.txt AC 12 ms 9180 KiB
in31.txt AC 11 ms 9320 KiB
in32.txt AC 11 ms 9304 KiB
in33.txt AC 11 ms 9208 KiB
in34.txt AC 12 ms 9276 KiB
in35.txt AC 613 ms 51548 KiB
in36.txt AC 548 ms 47344 KiB
in37.txt AC 12 ms 9216 KiB
in38.txt AC 12 ms 9328 KiB
in39.txt AC 13 ms 9344 KiB
in40.txt AC 12 ms 9288 KiB
in41.txt AC 15 ms 9464 KiB
in42.txt AC 15 ms 9572 KiB
in43.txt AC 11 ms 9216 KiB
in44.txt AC 12 ms 9304 KiB
in45.txt AC 12 ms 9308 KiB
in46.txt AC 12 ms 9304 KiB
in47.txt AC 543 ms 51416 KiB
in48.txt AC 545 ms 51416 KiB
in49.txt AC 545 ms 51548 KiB
in50.txt AC 562 ms 51552 KiB
in51.txt AC 14 ms 9560 KiB
in52.txt AC 173 ms 30040 KiB
in53.txt AC 568 ms 50008 KiB
in54.txt AC 489 ms 45884 KiB
in55.txt AC 566 ms 51448 KiB
in56.txt AC 363 ms 37576 KiB
in57.txt AC 12 ms 9288 KiB
in58.txt AC 12 ms 9304 KiB
in59.txt AC 463 ms 50304 KiB
in60.txt AC 418 ms 45144 KiB
in61.txt AC 540 ms 50392 KiB
in62.txt AC 461 ms 44680 KiB
in63.txt AC 11 ms 9316 KiB
in64.txt AC 12 ms 9312 KiB
in65.txt AC 12 ms 9328 KiB
in66.txt AC 12 ms 9304 KiB
in67.txt AC 12 ms 9252 KiB
in68.txt AC 12 ms 9352 KiB
in69.txt AC 13 ms 9444 KiB
in70.txt AC 13 ms 9436 KiB
in71.txt AC 13 ms 9440 KiB
in72.txt AC 12 ms 9320 KiB
in73.txt AC 12 ms 9304 KiB
in74.txt AC 222 ms 27120 KiB
in75.txt AC 220 ms 27112 KiB
in76.txt AC 11 ms 9288 KiB
in77.txt AC 12 ms 9180 KiB
in78.txt AC 497 ms 49340 KiB
in79.txt AC 538 ms 50376 KiB
in80.txt AC 296 ms 36796 KiB
in81.txt AC 315 ms 40840 KiB
in82.txt AC 299 ms 44504 KiB
sample01.txt AC 12 ms 9308 KiB
sample02.txt AC 12 ms 9312 KiB
sample03.txt AC 12 ms 9304 KiB