結果
問題 | No.1390 Get together |
ユーザー | itsy68 |
提出日時 | 2022-07-11 22:02:50 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 348 ms / 2,000 ms |
コード長 | 1,945 bytes |
コンパイル時間 | 903 ms |
コンパイル使用メモリ | 82,324 KB |
実行使用メモリ | 97,280 KB |
最終ジャッジ日時 | 2024-06-22 16:46:49 |
合計ジャッジ時間 | 7,906 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
63,016 KB |
testcase_01 | AC | 53 ms
63,104 KB |
testcase_02 | AC | 50 ms
64,088 KB |
testcase_03 | AC | 93 ms
77,568 KB |
testcase_04 | AC | 86 ms
77,568 KB |
testcase_05 | AC | 99 ms
77,864 KB |
testcase_06 | AC | 86 ms
77,472 KB |
testcase_07 | AC | 91 ms
77,440 KB |
testcase_08 | AC | 86 ms
77,312 KB |
testcase_09 | AC | 92 ms
77,824 KB |
testcase_10 | AC | 54 ms
62,976 KB |
testcase_11 | AC | 54 ms
62,844 KB |
testcase_12 | AC | 55 ms
62,592 KB |
testcase_13 | AC | 55 ms
63,148 KB |
testcase_14 | AC | 54 ms
62,776 KB |
testcase_15 | AC | 54 ms
63,360 KB |
testcase_16 | AC | 146 ms
94,336 KB |
testcase_17 | AC | 216 ms
95,512 KB |
testcase_18 | AC | 142 ms
94,464 KB |
testcase_19 | AC | 279 ms
96,984 KB |
testcase_20 | AC | 296 ms
97,024 KB |
testcase_21 | AC | 348 ms
97,280 KB |
testcase_22 | AC | 228 ms
96,368 KB |
testcase_23 | AC | 233 ms
96,740 KB |
testcase_24 | AC | 245 ms
96,512 KB |
testcase_25 | AC | 308 ms
96,768 KB |
testcase_26 | AC | 276 ms
96,724 KB |
testcase_27 | AC | 298 ms
96,764 KB |
testcase_28 | AC | 284 ms
96,640 KB |
testcase_29 | AC | 279 ms
96,768 KB |
testcase_30 | AC | 321 ms
96,768 KB |
testcase_31 | AC | 285 ms
97,024 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)