結果
問題 | No.1390 Get together |
ユーザー | itsy68 |
提出日時 | 2022-07-11 22:02:50 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 441 ms / 2,000 ms |
コード長 | 1,945 bytes |
コンパイル時間 | 1,216 ms |
コンパイル使用メモリ | 86,680 KB |
実行使用メモリ | 100,680 KB |
最終ジャッジ日時 | 2023-09-04 19:01:07 |
合計ジャッジ時間 | 11,074 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 119 ms
76,544 KB |
testcase_01 | AC | 120 ms
76,500 KB |
testcase_02 | AC | 120 ms
76,424 KB |
testcase_03 | AC | 156 ms
80,428 KB |
testcase_04 | AC | 147 ms
80,396 KB |
testcase_05 | AC | 163 ms
80,720 KB |
testcase_06 | AC | 148 ms
80,384 KB |
testcase_07 | AC | 158 ms
80,512 KB |
testcase_08 | AC | 150 ms
80,344 KB |
testcase_09 | AC | 156 ms
80,496 KB |
testcase_10 | AC | 121 ms
76,532 KB |
testcase_11 | AC | 122 ms
76,456 KB |
testcase_12 | AC | 121 ms
76,868 KB |
testcase_13 | AC | 122 ms
76,664 KB |
testcase_14 | AC | 121 ms
76,476 KB |
testcase_15 | AC | 121 ms
76,728 KB |
testcase_16 | AC | 218 ms
98,364 KB |
testcase_17 | AC | 302 ms
98,248 KB |
testcase_18 | AC | 210 ms
98,416 KB |
testcase_19 | AC | 410 ms
99,128 KB |
testcase_20 | AC | 387 ms
99,684 KB |
testcase_21 | AC | 441 ms
100,680 KB |
testcase_22 | AC | 315 ms
98,372 KB |
testcase_23 | AC | 315 ms
98,364 KB |
testcase_24 | AC | 327 ms
98,476 KB |
testcase_25 | AC | 414 ms
99,260 KB |
testcase_26 | AC | 388 ms
99,592 KB |
testcase_27 | AC | 405 ms
100,116 KB |
testcase_28 | AC | 400 ms
99,896 KB |
testcase_29 | AC | 389 ms
99,668 KB |
testcase_30 | AC | 415 ms
100,024 KB |
testcase_31 | AC | 381 ms
99,368 KB |
ソースコード
# import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') import sys from itertools import combinations, permutations, product, accumulate, groupby from collections import defaultdict, deque, Counter from functools import reduce import heapq import bisect import math import copy sys.setrecursionlimit(10 ** 9) input = lambda: sys.stdin.readline().rstrip() INF = float("inf") MOD = 10 ** 9 + 7 class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: 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: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def 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_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) N,M=map(int, input().split()) UF=UnionFind(M + 1) L = [[] for i in range(N + 1)] for i in range(N): b, c = map(int, input().split()) L[c].append(b) cnt = 0 for l in (L): for c in l: if not UF.same(l[0], c): UF.union(l[0], c) cnt += 1 print(cnt)