結果
問題 |
No.1390 Get together
|
ユーザー |
![]() |
提出日時 | 2022-11-29 18:26:48 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 980 ms / 2,000 ms |
コード長 | 2,307 bytes |
コンパイル時間 | 234 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 55,660 KB |
最終ジャッジ日時 | 2024-10-07 06:09:18 |
合計ジャッジ時間 | 17,651 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
ソースコード
from collections import defaultdict class UnionFind: n = 1 parent_or_size = [-1 for i in range(n)] def __init__(self, n0): self.n = n0 self.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 x if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x self.parent_or_size[x] += self.parent_or_size[y] self.parent_or_size[y] = x return x def 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 a self.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]] += 1 result = [[] 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 result2 def main(): n, m = map(int, input().split()) graph = defaultdict(list) for _ in range(n): b, c = map(int, input().split()) b -= 1 c -= 1 graph[b].append(c) uf = UnionFind(n) for v in graph.values(): for x, y in zip(v, v[1:]): uf.merge(x, y) cnt = [-1] * n for v in graph.values(): cnt[uf.leader(v[0])] += 1 ans = sum([x for x in cnt if x >= 1]) print(ans) if __name__ == "__main__": main()