結果
問題 | No.1812 Uribo Road |
ユーザー | MasKoaTS |
提出日時 | 2021-12-30 00:02:24 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 1,201 ms / 5,000 ms |
コード長 | 1,382 bytes |
コンパイル時間 | 588 ms |
コンパイル使用メモリ | 87,380 KB |
実行使用メモリ | 119,228 KB |
最終ジャッジ日時 | 2023-07-29 01:09:33 |
合計ジャッジ時間 | 15,891 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,352 KB |
testcase_01 | AC | 72 ms
71,200 KB |
testcase_02 | AC | 83 ms
76,444 KB |
testcase_03 | AC | 163 ms
82,116 KB |
testcase_04 | AC | 73 ms
71,232 KB |
testcase_05 | AC | 75 ms
71,580 KB |
testcase_06 | AC | 76 ms
71,572 KB |
testcase_07 | AC | 107 ms
77,864 KB |
testcase_08 | AC | 167 ms
78,904 KB |
testcase_09 | AC | 185 ms
78,652 KB |
testcase_10 | AC | 153 ms
78,312 KB |
testcase_11 | AC | 164 ms
78,700 KB |
testcase_12 | AC | 583 ms
88,912 KB |
testcase_13 | AC | 288 ms
87,436 KB |
testcase_14 | AC | 290 ms
87,616 KB |
testcase_15 | AC | 749 ms
99,144 KB |
testcase_16 | AC | 448 ms
83,760 KB |
testcase_17 | AC | 1,030 ms
103,908 KB |
testcase_18 | AC | 1,011 ms
119,228 KB |
testcase_19 | AC | 1,170 ms
109,964 KB |
testcase_20 | AC | 1,201 ms
110,604 KB |
testcase_21 | AC | 1,101 ms
111,940 KB |
testcase_22 | AC | 1,063 ms
112,116 KB |
testcase_23 | AC | 187 ms
78,932 KB |
testcase_24 | AC | 100 ms
76,436 KB |
testcase_25 | AC | 283 ms
83,384 KB |
testcase_26 | AC | 180 ms
78,756 KB |
testcase_27 | AC | 817 ms
107,376 KB |
testcase_28 | AC | 367 ms
85,256 KB |
testcase_29 | AC | 77 ms
71,452 KB |
testcase_30 | AC | 250 ms
80,656 KB |
testcase_31 | AC | 766 ms
98,804 KB |
testcase_32 | AC | 175 ms
79,180 KB |
testcase_33 | AC | 394 ms
90,172 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)