結果
問題 | No.1812 Uribo Road |
ユーザー | MasKoaTS |
提出日時 | 2021-12-31 15:11:43 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 2,367 ms / 5,000 ms |
コード長 | 1,390 bytes |
コンパイル時間 | 285 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 35,072 KB |
最終ジャッジ日時 | 2024-04-17 03:06:18 |
合計ジャッジ時間 | 23,731 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
11,008 KB |
testcase_01 | AC | 26 ms
10,880 KB |
testcase_02 | AC | 28 ms
11,008 KB |
testcase_03 | AC | 568 ms
17,152 KB |
testcase_04 | AC | 26 ms
11,008 KB |
testcase_05 | AC | 25 ms
11,008 KB |
testcase_06 | AC | 33 ms
11,008 KB |
testcase_07 | AC | 64 ms
11,648 KB |
testcase_08 | AC | 57 ms
11,648 KB |
testcase_09 | AC | 74 ms
11,904 KB |
testcase_10 | AC | 54 ms
11,520 KB |
testcase_11 | AC | 48 ms
11,264 KB |
testcase_12 | AC | 1,140 ms
31,872 KB |
testcase_13 | AC | 830 ms
31,104 KB |
testcase_14 | AC | 848 ms
30,464 KB |
testcase_15 | AC | 885 ms
19,572 KB |
testcase_16 | AC | 515 ms
23,680 KB |
testcase_17 | AC | 1,592 ms
24,192 KB |
testcase_18 | AC | 1,914 ms
22,020 KB |
testcase_19 | AC | 2,162 ms
29,440 KB |
testcase_20 | AC | 2,187 ms
29,568 KB |
testcase_21 | AC | 2,113 ms
35,072 KB |
testcase_22 | AC | 2,367 ms
35,072 KB |
testcase_23 | AC | 141 ms
12,672 KB |
testcase_24 | AC | 31 ms
11,008 KB |
testcase_25 | AC | 235 ms
17,536 KB |
testcase_26 | AC | 65 ms
11,520 KB |
testcase_27 | AC | 1,250 ms
17,588 KB |
testcase_28 | AC | 338 ms
19,840 KB |
testcase_29 | AC | 26 ms
10,880 KB |
testcase_30 | AC | 169 ms
12,288 KB |
testcase_31 | AC | 1,431 ms
22,272 KB |
testcase_32 | AC | 76 ms
11,648 KB |
testcase_33 | AC | 865 ms
22,016 KB |
ソースコード
import heapq as hq import sys input = sys.stdin.readline INF = 10 ** 18 N,M,K = map(int, input().split()) R = [i - 1 for i in map(int, input().split())] S = set(R) edge = [[] for _ in [0] * M] route = [[] for _ in [0] * N] for i in range(M): a,b,c = map(int, input().split()) a -= 1; b -= 1 route[a].append((b,c)) route[b].append((a,c)) if(i in S): edge[i] = [a,b,c] def dijkstra(s,route): que = [(0,s)] dist = [INF] * N while(que): d,v = hq.heappop(que) if(dist[v] < INF): continue dist[v] = d for nv,nd in route[v]: hq.heappush(que,(d + nd, nv)) return dist dist = [[] for _ in [0] * N] T = set([0,N - 1]) for i in S: T.add(edge[i][0]) T.add(edge[i][1]) for i in T: dist[i] = dijkstra(i,route) dp = [[[INF] * 2 for _ in [0] * K] for _ in [0] * (1 << K)] for i in range(K): for j in range(2): dp[1 << i][i][j] = dist[0][edge[R[i]][j ^ 1]] + edge[R[i]][2] for bit in range(1, 1 << K): for s in range(K): if not(bit & (1 << s)): continue for t in range(K): if(bit & (1 << t)): continue b = bit | (1 << t); c = edge[R[t]][2] for x in range(2): for y in range(2): p = edge[R[s]][x]; q = edge[R[t]][y ^ 1] d = dp[bit][s][x] + dist[p][q] + c if(dp[b][t][y] > d): dp[b][t][y] = d ans = INF for i in range(K): for j in range(2): d = dp[-1][i][j] + dist[edge[R[i]][j]][N - 1] if(ans > d): ans = d print(ans)