結果
問題 | No.748 yuki国のお財布事情 |
ユーザー | H3PO4 |
提出日時 | 2021-01-05 09:10:39 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,059 bytes |
コンパイル時間 | 155 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 118,320 KB |
最終ジャッジ日時 | 2024-04-23 15:36:10 |
合計ジャッジ時間 | 34,757 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,696 ms
56,284 KB |
testcase_01 | AC | 834 ms
56,396 KB |
testcase_02 | AC | 858 ms
56,148 KB |
testcase_03 | AC | 839 ms
56,920 KB |
testcase_04 | AC | 831 ms
56,156 KB |
testcase_05 | AC | 827 ms
56,408 KB |
testcase_06 | AC | 833 ms
56,276 KB |
testcase_07 | AC | 819 ms
56,280 KB |
testcase_08 | AC | 829 ms
56,284 KB |
testcase_09 | AC | 849 ms
56,152 KB |
testcase_10 | WA | - |
testcase_11 | AC | 832 ms
56,280 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 1,383 ms
88,384 KB |
testcase_22 | AC | 824 ms
56,292 KB |
testcase_23 | AC | 814 ms
56,148 KB |
testcase_24 | AC | 821 ms
56,156 KB |
testcase_25 | WA | - |
testcase_26 | AC | 1,437 ms
98,420 KB |
testcase_27 | AC | 1,443 ms
98,960 KB |
testcase_28 | AC | 1,182 ms
118,320 KB |
ソースコード
import sys from scipy.sparse.csgraph import minimum_spanning_tree from scipy.sparse import csr_matrix input = sys.stdin.buffer.readline class UnionFind: def __init__(self, n): self.n = n self.parent = [i for i in range(n)] self.height = [1] * n self.size = [1] * n def find(self, x): if self.parent[x] == x: return x else: self.parent[x] = self.find(self.parent[x]) return self.parent[x] def unite(self, x, y): x = self.find(x) y = self.find(y) if x != y: if self.height[x] < self.height[y]: self.parent[x] = y self.size[y] += self.size[x] else: self.parent[y] = x self.size[x] += self.size[y] if self.height[x] == self.height[y]: self.height[x] += 1 def issame(self, x, y): return self.find(x) == self.find(y) def group_size(self, x): return self.size[self.find(x)] def group_members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parent) if i == x] def group_count(self): return len(self.roots()) N, M, K = map(int, input().split()) ABC = [] for _ in range(M): a, b, c = map(int, input().split()) a -= 1 b -= 1 ABC.append([a, b, c]) cost = 0 uf = UnionFind(N) for _ in range(K): e = int(input()) - 1 a, b, c = ABC[e] uf.unite(a, b) cost += c compress_dict = {x: i for i, x in enumerate(uf.roots())} compress_N = uf.group_count() length, frm, to = [], [], [] for a, b, c in ABC: a, b = uf.find(a), uf.find(b) if a == b: continue a, b = compress_dict[a], compress_dict[b] length.append(c) frm.append(a) to.append(b) matr = csr_matrix((length, (frm, to)), shape=(N, N)) T = minimum_spanning_tree(matr) cost += int(T.sum()) ans = sum(c for _, _, c in ABC) - cost print(ans)