結果
問題 | No.848 なかよし旅行 |
ユーザー | Coki628 |
提出日時 | 2020-08-13 12:15:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 457 ms / 2,000 ms |
コード長 | 1,852 bytes |
コンパイル時間 | 267 ms |
コンパイル使用メモリ | 82,572 KB |
実行使用メモリ | 94,824 KB |
最終ジャッジ日時 | 2024-04-25 14:18:47 |
合計ジャッジ時間 | 6,243 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 457 ms
94,824 KB |
testcase_01 | AC | 48 ms
63,624 KB |
testcase_02 | AC | 37 ms
54,824 KB |
testcase_03 | AC | 39 ms
54,464 KB |
testcase_04 | AC | 39 ms
54,484 KB |
testcase_05 | AC | 39 ms
55,232 KB |
testcase_06 | AC | 54 ms
64,652 KB |
testcase_07 | AC | 44 ms
60,876 KB |
testcase_08 | AC | 83 ms
77,060 KB |
testcase_09 | AC | 99 ms
77,300 KB |
testcase_10 | AC | 84 ms
77,316 KB |
testcase_11 | AC | 220 ms
80,084 KB |
testcase_12 | AC | 242 ms
81,316 KB |
testcase_13 | AC | 250 ms
82,284 KB |
testcase_14 | AC | 204 ms
78,868 KB |
testcase_15 | AC | 255 ms
82,324 KB |
testcase_16 | AC | 329 ms
87,160 KB |
testcase_17 | AC | 232 ms
83,524 KB |
testcase_18 | AC | 202 ms
79,612 KB |
testcase_19 | AC | 204 ms
79,860 KB |
testcase_20 | AC | 180 ms
77,700 KB |
testcase_21 | AC | 254 ms
84,692 KB |
testcase_22 | AC | 168 ms
86,932 KB |
testcase_23 | AC | 196 ms
77,828 KB |
testcase_24 | AC | 39 ms
54,080 KB |
testcase_25 | AC | 334 ms
86,900 KB |
testcase_26 | AC | 37 ms
53,444 KB |
testcase_27 | AC | 37 ms
53,752 KB |
testcase_28 | AC | 38 ms
53,732 KB |
testcase_29 | AC | 38 ms
54,100 KB |
ソースコード
import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 19 MOD = 10 ** 9 + 7 EPS = 10 ** -10 def dijkstra(nodes: list, src: int) -> list: """ ダイクストラ高速化版(隣接リスト(0-indexed), 始点) """ from heapq import heappush, heappop N = len(nodes) res = [INF] * N que = [src] res[src] = 0 while que: cur = heappop(que) dist = cur // N cur %= N if res[cur] < dist: continue for nxt, cost in nodes[cur]: if dist + cost < res[nxt]: res[nxt] = dist + cost heappush(que, (dist+cost)*N+nxt) return res N, M, p, q, t = MAP() p -= 1; q -= 1 nodes = [[] for i in range(N)] for i in range(M): a, b, c = MAP() a -= 1; b -= 1 nodes[a].append((b, c)) nodes[b].append((a, c)) dist1 = dijkstra(nodes, 0) dist2 = dijkstra(nodes, p) dist3 = dijkstra(nodes, q) ans = -1 for i in range(N): for j in range(N): have = t - (dist1[i] + dist1[j] + max(dist2[i] + dist2[j], dist3[i] + dist3[j])) if have >= 0: ans = max(ans, have + dist1[i] + dist1[j]) have = t - (dist1[i] + dist2[i] + dist3[i] + dist1[j] + dist2[j] + dist3[j]) if have >= 0: ans = max(ans, t) print(ans)