結果
問題 | No.1390 Get together |
ユーザー | kept1994 |
提出日時 | 2021-08-29 12:22:54 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 730 ms / 2,000 ms |
コード長 | 2,297 bytes |
コンパイル時間 | 287 ms |
コンパイル使用メモリ | 86,656 KB |
実行使用メモリ | 129,304 KB |
最終ジャッジ日時 | 2023-08-14 09:21:26 |
合計ジャッジ時間 | 13,700 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
71,396 KB |
testcase_01 | AC | 94 ms
71,488 KB |
testcase_02 | AC | 94 ms
71,368 KB |
testcase_03 | AC | 204 ms
79,176 KB |
testcase_04 | AC | 162 ms
78,976 KB |
testcase_05 | AC | 159 ms
79,140 KB |
testcase_06 | AC | 152 ms
79,100 KB |
testcase_07 | AC | 155 ms
78,920 KB |
testcase_08 | AC | 161 ms
79,784 KB |
testcase_09 | AC | 172 ms
79,336 KB |
testcase_10 | AC | 93 ms
71,380 KB |
testcase_11 | AC | 91 ms
71,368 KB |
testcase_12 | AC | 93 ms
71,476 KB |
testcase_13 | AC | 94 ms
71,620 KB |
testcase_14 | AC | 93 ms
71,380 KB |
testcase_15 | AC | 95 ms
71,400 KB |
testcase_16 | AC | 414 ms
124,196 KB |
testcase_17 | AC | 411 ms
123,576 KB |
testcase_18 | AC | 384 ms
127,264 KB |
testcase_19 | AC | 681 ms
127,048 KB |
testcase_20 | AC | 730 ms
124,504 KB |
testcase_21 | AC | 709 ms
123,764 KB |
testcase_22 | AC | 560 ms
126,200 KB |
testcase_23 | AC | 580 ms
127,000 KB |
testcase_24 | AC | 576 ms
129,304 KB |
testcase_25 | AC | 653 ms
127,032 KB |
testcase_26 | AC | 662 ms
127,008 KB |
testcase_27 | AC | 655 ms
126,676 KB |
testcase_28 | AC | 620 ms
126,228 KB |
testcase_29 | AC | 663 ms
127,044 KB |
testcase_30 | AC | 632 ms
125,700 KB |
testcase_31 | AC | 673 ms
127,288 KB |
ソースコード
#!/usr/bin/env python3 import sys def main(): N, M = map(int, input().split()) box = [[] for _ in range(M)] color = [[] for _ in range(N)] B, C = [], [] for i in range(N): bb, cc = map(lambda i: int(i) - 1, input().split()) box[bb].append(i) color[cc].append(i) B.append(bb) C.append(cc) from collections import defaultdict 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 0 if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x return 1 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()) uf = UnionFind(N) ans = 0 for i in range(M): for j in range(len(box[i]) - 1): # print(box[i][j] + 1, box[i][j + 1] + 1) uf.union(box[i][j], box[i][j + 1]) # print("---") for i in range(N): for j in range(len(color[i]) - 1): # print(color[i][j] + 1, color[i][j + 1] + 1) ans += uf.union(color[i][j], color[i][j + 1]) # print(uf) print(ans) return if __name__ == '__main__': main()