結果
問題 | No.1690 Power Grid |
ユーザー | neterukun |
提出日時 | 2021-09-24 22:19:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,874 ms / 3,000 ms |
コード長 | 1,305 bytes |
コンパイル時間 | 258 ms |
コンパイル使用メモリ | 87,100 KB |
実行使用メモリ | 117,276 KB |
最終ジャッジ日時 | 2023-09-18 21:38:18 |
合計ジャッジ時間 | 32,825 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,376 KB |
testcase_01 | AC | 71 ms
71,272 KB |
testcase_02 | AC | 78 ms
71,300 KB |
testcase_03 | AC | 71 ms
71,472 KB |
testcase_04 | AC | 71 ms
71,432 KB |
testcase_05 | AC | 72 ms
71,592 KB |
testcase_06 | AC | 1,438 ms
98,824 KB |
testcase_07 | AC | 1,411 ms
98,592 KB |
testcase_08 | AC | 1,416 ms
98,616 KB |
testcase_09 | AC | 1,416 ms
98,448 KB |
testcase_10 | AC | 305 ms
83,420 KB |
testcase_11 | AC | 2,675 ms
114,824 KB |
testcase_12 | AC | 74 ms
71,300 KB |
testcase_13 | AC | 106 ms
77,624 KB |
testcase_14 | AC | 275 ms
80,368 KB |
testcase_15 | AC | 2,874 ms
117,276 KB |
testcase_16 | AC | 1,427 ms
98,616 KB |
testcase_17 | AC | 781 ms
88,172 KB |
testcase_18 | AC | 386 ms
83,104 KB |
testcase_19 | AC | 1,433 ms
98,480 KB |
testcase_20 | AC | 1,448 ms
98,608 KB |
testcase_21 | AC | 194 ms
81,480 KB |
testcase_22 | AC | 2,274 ms
106,736 KB |
testcase_23 | AC | 2,814 ms
117,100 KB |
testcase_24 | AC | 2,506 ms
111,124 KB |
testcase_25 | AC | 2,623 ms
113,116 KB |
testcase_26 | AC | 2,733 ms
114,896 KB |
testcase_27 | AC | 72 ms
71,376 KB |
ソースコード
INF = 10 ** 18 def warshall_floyd(matrix): n = len(matrix) dist = [[d for d in row] for row in matrix] for k in range(n): for i in range(n): for j in range(n): dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]) return dist def cost(state, v): res = INF for nxt_v in range(n): if state & (1 << nxt_v): res = min(res, dist[v][nxt_v]) if res == INF: return 0 else: return res n, m, k = map(int, input().split()) a = list(map(int, input().split())) edges = [list(map(int, input().split())) for i in range(m)] matrix = [[INF] * n for i in range(n)] for i in range(n): matrix[i][i] = 0 for u, v, c in edges: u -= 1 v -= 1 matrix[u][v] = c matrix[v][u] = c dist = warshall_floyd(matrix) dp = [INF] * (1 << n) dp[0] = 0 for i in range(k): dq = [INF] * (1 << n) for bit_state in range(1 << n): if bin(bit_state).count("1") != i: continue for new_v in range(n): if bit_state & (1 << new_v): continue new_state = bit_state | (1 << new_v) dq[new_state] = min(dq[new_state], dp[bit_state] + a[new_v] + cost(bit_state, new_v)) dp, dq = dq, dp print(min(dp))