結果
問題 | No.1812 Uribo Road |
ユーザー | brthyyjp |
提出日時 | 2022-01-16 13:34:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 576 ms / 5,000 ms |
コード長 | 2,082 bytes |
コンパイル時間 | 753 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 92,144 KB |
最終ジャッジ日時 | 2024-05-02 17:30:18 |
合計ジャッジ時間 | 8,891 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
52,992 KB |
testcase_01 | AC | 38 ms
52,864 KB |
testcase_02 | AC | 54 ms
59,776 KB |
testcase_03 | AC | 136 ms
81,152 KB |
testcase_04 | AC | 40 ms
53,120 KB |
testcase_05 | AC | 40 ms
53,632 KB |
testcase_06 | AC | 40 ms
53,376 KB |
testcase_07 | AC | 86 ms
76,544 KB |
testcase_08 | AC | 131 ms
77,204 KB |
testcase_09 | AC | 148 ms
77,056 KB |
testcase_10 | AC | 123 ms
77,376 KB |
testcase_11 | AC | 108 ms
76,544 KB |
testcase_12 | AC | 318 ms
85,888 KB |
testcase_13 | AC | 188 ms
85,504 KB |
testcase_14 | AC | 188 ms
85,632 KB |
testcase_15 | AC | 264 ms
80,860 KB |
testcase_16 | AC | 262 ms
81,664 KB |
testcase_17 | AC | 502 ms
87,752 KB |
testcase_18 | AC | 212 ms
84,456 KB |
testcase_19 | AC | 576 ms
92,144 KB |
testcase_20 | AC | 555 ms
91,652 KB |
testcase_21 | AC | 478 ms
89,272 KB |
testcase_22 | AC | 388 ms
88,396 KB |
testcase_23 | AC | 140 ms
77,968 KB |
testcase_24 | AC | 52 ms
62,336 KB |
testcase_25 | AC | 187 ms
79,304 KB |
testcase_26 | AC | 124 ms
76,724 KB |
testcase_27 | AC | 187 ms
81,588 KB |
testcase_28 | AC | 238 ms
80,972 KB |
testcase_29 | AC | 40 ms
53,120 KB |
testcase_30 | AC | 143 ms
77,780 KB |
testcase_31 | AC | 377 ms
85,472 KB |
testcase_32 | AC | 120 ms
76,644 KB |
testcase_33 | AC | 281 ms
86,272 KB |
ソースコード
import sys import io, os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline import heapq INF = 10**18 def dijkstra(s, edge): n = len(edge) dist = [INF]*n dist[s] = 0 edgelist = [] heapq.heappush(edgelist,(dist[s], s)) while edgelist: minedge = heapq.heappop(edgelist) if dist[minedge[1]] < minedge[0]: continue v = minedge[1] for e in edge[v]: if dist[e[1]] > dist[v]+e[0]: dist[e[1]] = dist[v]+e[0] heapq.heappush(edgelist,(dist[e[1]], e[1])) return dist def main(): n, m, k = map(int, input().split()) R = list(map(int, input().split())) R = [r-1 for r in R] toid = {} for i, r in enumerate(R): toid[r] = i g = [[] for i in range(n)] ABC = [] for i in range(m): a, b, c = map(int, input().split()) a, b = a-1, b-1 g[a].append((c, b)) g[b].append((c, a)) if i in toid: ABC.append((a, b, c)) dists = dijkstra(0, g) distt = dijkstra(n-1, g) D = [] for i in range(k): a, b = ABC[i][0], ABC[i][1] dista = dijkstra(a, g) distb = dijkstra(b, g) D.append([dista,distb]) dp = [[[INF]*2 for i in range(k)] for i in range(1<<k)] for i, (a, b, c) in enumerate(ABC): dp[1<<i][i][0] = dists[b]+c dp[1<<i][i][1] = dists[a]+c for s in range(1<<k): for i in range(k): if (s>>i)&1: continue ns = s|(1<<i) c = ABC[i][2] for j in range(k): if not ((s>>j)&1): continue if i == j: continue for x in range(2): for y in range(2): dp[ns][i][x] = min(dp[ns][i][x], dp[s][j][y]+D[i][1-x][ABC[j][y]]+c) ans = INF for i in range(k): for x in range(2): v = ABC[i][x] ans = min(ans, dp[(1<<k)-1][i][x]+distt[v]) print(ans) if __name__ == '__main__': main()