結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | Shinya Fujita |
提出日時 | 2024-10-27 00:55:32 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,221 bytes |
コンパイル時間 | 369 ms |
コンパイル使用メモリ | 82,404 KB |
実行使用メモリ | 277,540 KB |
最終ジャッジ日時 | 2024-10-27 00:57:11 |
合計ジャッジ時間 | 95,645 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
53,228 KB |
testcase_01 | AC | 37 ms
53,148 KB |
testcase_02 | TLE | - |
testcase_03 | AC | 2,744 ms
245,180 KB |
testcase_04 | AC | 2,961 ms
275,504 KB |
testcase_05 | TLE | - |
testcase_06 | AC | 2,787 ms
271,720 KB |
testcase_07 | AC | 2,969 ms
269,820 KB |
testcase_08 | AC | 2,660 ms
245,488 KB |
testcase_09 | AC | 2,437 ms
256,416 KB |
testcase_10 | WA | - |
testcase_11 | TLE | - |
testcase_12 | AC | 2,872 ms
273,340 KB |
testcase_13 | TLE | - |
testcase_14 | AC | 2,574 ms
254,468 KB |
testcase_15 | AC | 2,704 ms
259,724 KB |
testcase_16 | AC | 2,990 ms
273,844 KB |
testcase_17 | TLE | - |
testcase_18 | AC | 2,741 ms
259,080 KB |
testcase_19 | AC | 2,744 ms
271,996 KB |
testcase_20 | AC | 2,540 ms
272,484 KB |
testcase_21 | TLE | - |
testcase_22 | AC | 2,457 ms
273,356 KB |
testcase_23 | TLE | - |
testcase_24 | AC | 2,738 ms
272,032 KB |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | AC | 2,978 ms
260,528 KB |
testcase_29 | WA | - |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | TLE | - |
ソースコード
from heapq import heappop, heappush N, M = map(int, input().split()) graph = [[] for _ in range(N)] pos = {} for _ in range(M): a, b, c, d = map(int, input().split()) a -= 1; b -= 1 pos[a, b, c] = len(graph[a]) pos[b, a, c] = len(graph[b]) graph[a].append([b, c]) graph[b].append([a, c]) pos[a, b, d] = len(graph[a]) pos[b, a, d] = len(graph[b]) graph[a].append([b, d]) graph[b].append([a, d]) D = [[-1, None] for _ in range(N+1)] hq = [(0, 0, None)] while hq: d, node, par = heappop(hq) if D[node][0] != -1: continue D[node] = [d, par] for nex, c in graph[node]: if D[nex][0] == -1: heappush(hq, (D[node][0]+c, nex, node)) INF = 10**10 ans = D[N-1][0] now = N-1 while now: d, par = D[now] c = d - D[par][0] i1 = pos[par, now, c] i2 = pos[now, par, c] graph[par][i1][1] = graph[now][i2][1] = INF now = par D = [[-1, None] for _ in range(N)] hq = [(0, N-1, None)] while hq: d, node, par = heappop(hq) if D[node][0] != -1: continue D[node] = [d, par] for nex, c in graph[node]: if D[nex][0] == -1: heappush(hq, (D[node][0]+c, nex, node)) print(D[0][0]+ans)