結果
問題 | No.1812 Uribo Road |
ユーザー | MasKoaTS |
提出日時 | 2021-12-30 14:14:10 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 2,870 ms / 5,000 ms |
コード長 | 1,382 bytes |
コンパイル時間 | 138 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 35,072 KB |
最終ジャッジ日時 | 2024-10-07 00:51:44 |
合計ジャッジ時間 | 28,675 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
10,880 KB |
testcase_01 | AC | 32 ms
10,880 KB |
testcase_02 | AC | 35 ms
10,880 KB |
testcase_03 | AC | 678 ms
17,024 KB |
testcase_04 | AC | 32 ms
10,880 KB |
testcase_05 | AC | 33 ms
10,880 KB |
testcase_06 | AC | 33 ms
11,008 KB |
testcase_07 | AC | 76 ms
11,520 KB |
testcase_08 | AC | 66 ms
11,520 KB |
testcase_09 | AC | 85 ms
11,776 KB |
testcase_10 | AC | 62 ms
11,520 KB |
testcase_11 | AC | 54 ms
11,264 KB |
testcase_12 | AC | 1,410 ms
31,872 KB |
testcase_13 | AC | 1,000 ms
31,104 KB |
testcase_14 | AC | 973 ms
30,464 KB |
testcase_15 | AC | 1,146 ms
19,308 KB |
testcase_16 | AC | 658 ms
23,296 KB |
testcase_17 | AC | 2,035 ms
24,192 KB |
testcase_18 | AC | 2,311 ms
21,828 KB |
testcase_19 | AC | 2,688 ms
29,184 KB |
testcase_20 | AC | 2,740 ms
29,312 KB |
testcase_21 | AC | 2,725 ms
35,072 KB |
testcase_22 | AC | 2,870 ms
34,944 KB |
testcase_23 | AC | 155 ms
12,544 KB |
testcase_24 | AC | 33 ms
10,880 KB |
testcase_25 | AC | 273 ms
17,280 KB |
testcase_26 | AC | 71 ms
11,392 KB |
testcase_27 | AC | 1,534 ms
17,736 KB |
testcase_28 | AC | 450 ms
19,712 KB |
testcase_29 | AC | 31 ms
10,880 KB |
testcase_30 | AC | 190 ms
12,160 KB |
testcase_31 | AC | 1,730 ms
22,144 KB |
testcase_32 | AC | 86 ms
11,520 KB |
testcase_33 | AC | 1,038 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] rsum = 0 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] rsum += 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] = rsum + dist[0][edge[R[i]][j]] for bit in range(1, 1 << K): for s in range(K): if not(bit & (1 << s)): continue for i in range(2): for t in range(K): if not(bit & (1 << t)): b = bit | (1 << t) for j in range(2): p = edge[R[t]][j] d = dp[bit][s][i ^ 1] + dist[edge[R[s]][i]][edge[R[t]][j]] if(dp[b][t][j] > d): dp[b][t][j] = d ans = INF for i in range(K): for j in range(2): d = dp[-1][i][j ^ 1] + dist[edge[R[i]][j]][N - 1] if(ans > d): ans = d print(ans)