結果
問題 | No.807 umg tours |
ユーザー | roaris |
提出日時 | 2019-08-04 19:11:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,701 ms / 4,000 ms |
コード長 | 1,778 bytes |
コンパイル時間 | 384 ms |
コンパイル使用メモリ | 87,248 KB |
実行使用メモリ | 183,968 KB |
最終ジャッジ日時 | 2023-09-22 23:35:21 |
合計ジャッジ時間 | 37,459 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 105 ms
76,756 KB |
testcase_01 | AC | 104 ms
76,740 KB |
testcase_02 | AC | 107 ms
76,868 KB |
testcase_03 | AC | 105 ms
76,672 KB |
testcase_04 | AC | 98 ms
76,552 KB |
testcase_05 | AC | 106 ms
76,776 KB |
testcase_06 | AC | 106 ms
76,856 KB |
testcase_07 | AC | 106 ms
76,912 KB |
testcase_08 | AC | 91 ms
71,700 KB |
testcase_09 | AC | 92 ms
71,728 KB |
testcase_10 | AC | 91 ms
71,684 KB |
testcase_11 | AC | 1,597 ms
122,644 KB |
testcase_12 | AC | 2,198 ms
140,708 KB |
testcase_13 | AC | 2,554 ms
153,100 KB |
testcase_14 | AC | 1,306 ms
114,420 KB |
testcase_15 | AC | 921 ms
104,436 KB |
testcase_16 | AC | 2,561 ms
151,964 KB |
testcase_17 | AC | 3,495 ms
177,580 KB |
testcase_18 | AC | 3,471 ms
175,540 KB |
testcase_19 | AC | 3,215 ms
170,092 KB |
testcase_20 | AC | 1,838 ms
141,956 KB |
testcase_21 | AC | 1,882 ms
145,976 KB |
testcase_22 | AC | 824 ms
106,040 KB |
testcase_23 | AC | 682 ms
99,792 KB |
testcase_24 | AC | 1,810 ms
174,052 KB |
testcase_25 | AC | 3,701 ms
183,968 KB |
ソースコード
from heapq import heappush, heappop from collections import defaultdict import sys input = sys.stdin.readline def dijkstra(start): distance = [[10**18 for _ in range(2)] for _ in range(N+1)] distance[start][0] = 0 distance[start][1] = 0 priority_queue = [] for i in range(1, N+1): for j in range(2): heappush(priority_queue, (distance[i][j], i, j)) while len(priority_queue) > 0: current_dist, current_node, state = heappop(priority_queue) if distance[current_node][state] < current_dist: continue if state == 0: for next_node, w in adj_dict[current_node]: if distance[next_node][0] > distance[current_node][0] + w: distance[next_node][0] = distance[current_node][0] + w heappush(priority_queue, (distance[next_node][0], next_node, 0)) if distance[next_node][1] > distance[current_node][0]: distance[next_node][1] = distance[current_node][0] heappush(priority_queue, (distance[next_node][1], next_node, 1)) else: for next_node, w in adj_dict[current_node]: if distance[next_node][1] > distance[current_node][1] + w: distance[next_node][1] = distance[current_node][1] + w heappush(priority_queue, (distance[next_node][1], next_node, 1)) return distance N, M = map(int, input().split()) adj_dict = defaultdict(list) for _ in range(M): a_i, b_i, c_i = map(int, input().split()) adj_dict[a_i].append((b_i, c_i)) adj_dict[b_i].append((a_i, c_i)) distance = dijkstra(1) for i in range(1, N+1): ans = distance[i][0] + distance[i][1] print(ans)