結果
問題 |
No.1812 Uribo Road
|
ユーザー |
![]() |
提出日時 | 2021-12-30 00:02:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,073 ms / 5,000 ms |
コード長 | 1,382 bytes |
コンパイル時間 | 294 ms |
コンパイル使用メモリ | 81,848 KB |
実行使用メモリ | 117,888 KB |
最終ジャッジ日時 | 2024-10-07 00:50:06 |
合計ジャッジ時間 | 12,940 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
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)