結果
問題 | No.1690 Power Grid |
ユーザー |
![]() |
提出日時 | 2021-09-24 22:10:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,701 ms / 3,000 ms |
コード長 | 1,313 bytes |
コンパイル時間 | 269 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 115,840 KB |
最終ジャッジ日時 | 2024-07-05 10:41:54 |
合計ジャッジ時間 | 30,060 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
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) for i in range(k + 1)] dp[0][0] = 0 for i in range(k): 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) dp[i + 1][new_state] = min(dp[i + 1][new_state], dp[i][bit_state] + a[new_v] + cost(bit_state, new_v)) print(min(dp[k]))