結果
問題 | No.748 yuki国のお財布事情 |
ユーザー |
![]() |
提出日時 | 2021-09-25 12:51:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 610 ms / 2,000 ms |
コード長 | 1,874 bytes |
コンパイル時間 | 181 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 95,988 KB |
最終ジャッジ日時 | 2024-07-05 12:04:07 |
合計ジャッジ時間 | 8,451 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
n, m, k = map(int, input().split())A=[]sum = 0a = [0 for i in range(m)]b = [0 for i in range(m)]c = [0 for i in range(m)]d = [0 for i in range(m)]for i in range(m):a[i], b[i], c[i] = map(int, input().split())sum += c[i]for i in range(k):e = int(input())d[e - 1] = 1for i in range(m):A.append([c[i], a[i] - 1, b[i] - 1, d[i]])A.sort()from collections import defaultdictclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):if self.parents[x] < 0:return xelse:self.parents[x] = self.find(self.parents[x])return self.parents[x]def union(self, x, y):x = self.find(x)y = self.find(y)if x == y:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xdef size(self, x):return -self.parents[self.find(x)]def same(self, x, y):return self.find(x) == self.find(y)def 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.parents) if x < 0]def group_count(self):return len(self.roots())def all_group_members(self):group_members = defaultdict(list)for member in range(self.n):group_members[self.find(member)].append(member)return group_membersdef __str__(self):return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())t = 0uf = UnionFind(n)for [c, a, b, d] in A:if d == 1:t += cuf.union(a,b)for [c, a, b, d] in A:if d == 0:if not uf.same(a,b):t += cuf.union(a,b)print(sum - t)