結果
問題 | No.1690 Power Grid |
ユーザー | qib |
提出日時 | 2022-12-19 00:11:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 983 ms / 3,000 ms |
コード長 | 1,601 bytes |
コンパイル時間 | 840 ms |
コンパイル使用メモリ | 86,640 KB |
実行使用メモリ | 79,264 KB |
最終ジャッジ日時 | 2023-08-11 09:20:11 |
合計ジャッジ時間 | 10,312 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,396 KB |
testcase_01 | AC | 70 ms
71,052 KB |
testcase_02 | AC | 70 ms
71,076 KB |
testcase_03 | AC | 71 ms
71,004 KB |
testcase_04 | AC | 71 ms
71,356 KB |
testcase_05 | AC | 72 ms
71,096 KB |
testcase_06 | AC | 540 ms
77,928 KB |
testcase_07 | AC | 608 ms
78,232 KB |
testcase_08 | AC | 643 ms
78,404 KB |
testcase_09 | AC | 623 ms
78,124 KB |
testcase_10 | AC | 79 ms
76,152 KB |
testcase_11 | AC | 88 ms
76,640 KB |
testcase_12 | AC | 71 ms
71,184 KB |
testcase_13 | AC | 105 ms
77,728 KB |
testcase_14 | AC | 236 ms
78,488 KB |
testcase_15 | AC | 79 ms
76,208 KB |
testcase_16 | AC | 981 ms
79,264 KB |
testcase_17 | AC | 579 ms
78,588 KB |
testcase_18 | AC | 329 ms
79,060 KB |
testcase_19 | AC | 946 ms
78,892 KB |
testcase_20 | AC | 983 ms
79,012 KB |
testcase_21 | AC | 72 ms
71,132 KB |
testcase_22 | AC | 510 ms
78,260 KB |
testcase_23 | AC | 78 ms
75,996 KB |
testcase_24 | AC | 190 ms
78,868 KB |
testcase_25 | AC | 139 ms
78,176 KB |
testcase_26 | AC | 96 ms
77,076 KB |
testcase_27 | AC | 72 ms
71,200 KB |
ソースコード
class UnionFind: def __init__(self, n): self.node = [-1 for _ in range(n)] def root(self, v): if self.node[v] < 0: return v st = [] while self.node[v] >= 0: st.append(v) v = self.node[v] for u in st: self.node[u] = v return v def size(self, v): v = self.root(v) return (- self.node[v]) def same(self, u, v): return self.root(u) == self.root(v) def unite(self, u, v): ru = self.root(u) rv = self.root(v) if ru == rv: return du = self.node[ru] dv = self.node[rv] if du <= dv: self.node[rv] = ru self.node[ru] += dv else: self.node[ru] = rv self.node[rv] += du from itertools import combinations INF = 1 << 60 n, m, k = map(int, input().split()) a = list(map(int, input().split())) if k == 1: print(min(a)) exit() dist = [[INF for _ in range(n)] for _ in range(n)] for u in range(n): dist[u][u] = 0 for _ in range(m): x, y, z = map(int, input().split()) x -= 1 y -= 1 dist[x][y] = z dist[y][x] = z for t in range(n): for u in range(n): for v in range(n): if dist[u][t] + dist[t][v] < dist[u][v]: dist[u][v] = dist[u][t] + dist[t][v] ans = INF for vs in combinations([u for u in range(n)], k): edges = [] for i in range(len(vs) - 1): for j in range(i + 1, len(vs)): edges.append((dist[vs[i]][vs[j]], i, j)) edges.sort(key=lambda x: x[0]) uf = UnionFind(k) cnt = sum(a[v] for v in vs) for w, u, v in edges: if not uf.same(u, v): uf.unite(u, v) cnt += w ans = min(ans, cnt) print(ans)