結果
問題 | No.1639 最小通信路 |
ユーザー |
![]() |
提出日時 | 2022-12-04 02:44:11 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 2,188 bytes |
コンパイル時間 | 139 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 11,136 KB |
最終ジャッジ日時 | 2024-10-11 04:43:52 |
合計ジャッジ時間 | 3,244 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 43 |
ソースコード
class UnionFind:n = 1parent_or_size = [-1 for i in range(n)]def __init__(self, n0):self.n = n0self.parent_or_size = [-1 for _ in range(n0)]def merge(self, a, b):assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)x = self.leader(a)y = self.leader(b)if x == y:return xif -self.parent_or_size[x] < -self.parent_or_size[y]:x, y = y, xself.parent_or_size[x] += self.parent_or_size[y]self.parent_or_size[y] = xreturn xdef same(self, a, b):assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)return self.leader(a) == self.leader(b)def leader(self, a):assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)if self.parent_or_size[a] < 0:return aself.parent_or_size[a] = self.leader(self.parent_or_size[a])return self.parent_or_size[a]def size(self, a):assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)return -self.parent_or_size[self.leader(a)]def groups(self):leader_buf = [0 for _ in range(self.n)]group_size = [0 for _ in range(self.n)]for i in range(self.n):leader_buf[i] = self.leader(i)group_size[leader_buf[i]] += 1result = [[] for _ in range(self.n)]for i in range(self.n):result[leader_buf[i]].append(i)result2 = []for i in range(self.n):if len(result[i]) > 0:result2.append(result[i])return result2def main():n = int(input())uf = UnionFind(n)for _ in range(n * (n - 1) // 2):a, b, c = map(int, input().split())a -= 1b -= 1if uf.same(a, b): # cは降順なので初回につなぐcontinueuf.merge(a, b)if uf.size(0) == n: # 全部つながったら終わり。exit(print(c))if __name__ == "__main__":main()