結果
問題 | No.848 なかよし旅行 |
ユーザー | roaris |
提出日時 | 2019-07-26 16:43:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 533 ms / 2,000 ms |
コード長 | 1,589 bytes |
コンパイル時間 | 170 ms |
コンパイル使用メモリ | 82,376 KB |
実行使用メモリ | 104,592 KB |
最終ジャッジ日時 | 2024-04-25 14:07:03 |
合計ジャッジ時間 | 7,131 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 533 ms
104,592 KB |
testcase_01 | AC | 51 ms
64,256 KB |
testcase_02 | AC | 39 ms
55,672 KB |
testcase_03 | AC | 40 ms
56,208 KB |
testcase_04 | AC | 40 ms
55,588 KB |
testcase_05 | AC | 41 ms
56,664 KB |
testcase_06 | AC | 57 ms
67,000 KB |
testcase_07 | AC | 44 ms
61,232 KB |
testcase_08 | AC | 100 ms
77,392 KB |
testcase_09 | AC | 121 ms
78,284 KB |
testcase_10 | AC | 106 ms
77,856 KB |
testcase_11 | AC | 271 ms
82,128 KB |
testcase_12 | AC | 290 ms
83,704 KB |
testcase_13 | AC | 310 ms
84,592 KB |
testcase_14 | AC | 263 ms
80,952 KB |
testcase_15 | AC | 315 ms
84,200 KB |
testcase_16 | AC | 365 ms
89,808 KB |
testcase_17 | AC | 306 ms
85,424 KB |
testcase_18 | AC | 280 ms
82,208 KB |
testcase_19 | AC | 273 ms
82,260 KB |
testcase_20 | AC | 220 ms
79,904 KB |
testcase_21 | AC | 330 ms
86,572 KB |
testcase_22 | AC | 257 ms
88,504 KB |
testcase_23 | AC | 219 ms
80,156 KB |
testcase_24 | AC | 40 ms
54,784 KB |
testcase_25 | AC | 380 ms
90,128 KB |
testcase_26 | AC | 40 ms
54,188 KB |
testcase_27 | AC | 39 ms
55,000 KB |
testcase_28 | AC | 40 ms
56,108 KB |
testcase_29 | AC | 40 ms
55,628 KB |
ソースコード
from heapq import heappush, heappop from collections import defaultdict def dijkstra(start): distance = [10 ** 18 for _ in range(N)] distance[start] = 0 priority_queue = [] for i in range(N): heappush(priority_queue, (distance[i], i)) while len(priority_queue) > 0: current_dist, current_node = heappop(priority_queue) if distance[current_node] < current_dist: continue for next_node, w in adj_dict[current_node]: if distance[next_node] > distance[current_node] + w: distance[next_node] = distance[current_node] + w heappush(priority_queue, (distance[next_node], next_node)) return distance N, M, P, Q, T = 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-1].append((b_i-1, c_i)) adj_dict[b_i-1].append((a_i-1, c_i)) distance_from0 = dijkstra(0) distance_fromP = dijkstra(P-1) distance_fromQ = dijkstra(Q-1) ans = -10 ** 18 if distance_from0[P-1] + distance_fromP[Q-1] + distance_fromQ[0] <= T: print(T) exit() for m1 in range(N): for m2 in range(m1, N): if distance_from0[m1] + max(distance_fromP[m1]+distance_fromP[m2], distance_fromQ[m1]+distance_fromQ[m2]) + distance_from0[m2] <= T: ans = max(ans, distance_from0[m1] + distance_from0[m2] + T - (distance_from0[m1] + max(distance_fromP[m1]+distance_fromP[m2], distance_fromQ[m1]+distance_fromQ[m2]) + distance_from0[m2])) if ans == -10 ** 18: print(-1) else: print(ans)