結果
問題 | No.2563 色ごとのグループ |
ユーザー | けんぴん |
提出日時 | 2023-09-23 20:01:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 644 ms / 2,000 ms |
コード長 | 2,083 bytes |
コンパイル時間 | 165 ms |
コンパイル使用メモリ | 81,828 KB |
実行使用メモリ | 124,128 KB |
最終ジャッジ日時 | 2023-12-02 14:00:38 |
合計ジャッジ時間 | 9,175 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
55,608 KB |
testcase_01 | AC | 45 ms
55,608 KB |
testcase_02 | AC | 42 ms
55,608 KB |
testcase_03 | AC | 40 ms
55,608 KB |
testcase_04 | AC | 41 ms
55,608 KB |
testcase_05 | AC | 40 ms
55,608 KB |
testcase_06 | AC | 40 ms
55,608 KB |
testcase_07 | AC | 40 ms
55,608 KB |
testcase_08 | AC | 40 ms
55,608 KB |
testcase_09 | AC | 42 ms
55,608 KB |
testcase_10 | AC | 41 ms
55,608 KB |
testcase_11 | AC | 43 ms
55,608 KB |
testcase_12 | AC | 42 ms
55,608 KB |
testcase_13 | AC | 41 ms
55,608 KB |
testcase_14 | AC | 78 ms
74,244 KB |
testcase_15 | AC | 82 ms
76,672 KB |
testcase_16 | AC | 77 ms
74,628 KB |
testcase_17 | AC | 78 ms
74,372 KB |
testcase_18 | AC | 56 ms
66,528 KB |
testcase_19 | AC | 86 ms
76,800 KB |
testcase_20 | AC | 97 ms
79,008 KB |
testcase_21 | AC | 93 ms
78,272 KB |
testcase_22 | AC | 93 ms
77,524 KB |
testcase_23 | AC | 101 ms
79,700 KB |
testcase_24 | AC | 260 ms
102,696 KB |
testcase_25 | AC | 226 ms
99,664 KB |
testcase_26 | AC | 287 ms
108,072 KB |
testcase_27 | AC | 245 ms
110,456 KB |
testcase_28 | AC | 318 ms
110,284 KB |
testcase_29 | AC | 403 ms
124,056 KB |
testcase_30 | AC | 396 ms
124,128 KB |
testcase_31 | AC | 400 ms
124,124 KB |
testcase_32 | AC | 394 ms
124,120 KB |
testcase_33 | AC | 644 ms
115,668 KB |
testcase_34 | AC | 620 ms
117,372 KB |
testcase_35 | AC | 613 ms
115,716 KB |
testcase_36 | AC | 612 ms
116,416 KB |
testcase_37 | AC | 593 ms
115,788 KB |
ソースコード
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 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()) def main(): N,M = map(int,input().split()) C = list(map(int,input().split())) C_dict = defaultdict(list) assert 1 <= N <= 2*10**5 assert 0 <= M <= min(2*10**5, N*(N-1)//2) for i,c in enumerate(C): assert 1 <= c <= N C_dict[c].append(i) uv_set = set() uf = UnionFind(N) for _ in [0]*M: u,v = map(int,input().split()) assert u != v assert (u,v) not in uv_set assert (v,u) not in uv_set assert 1 <= u <= N assert 1 <= v <= N uv_set.add((u,v)) if C[u-1] == C[v-1]: uf.union(u-1,v-1) # print(C_dict) # print(uf) ans = 0 for c in C_dict: set_per_c = set() for i in C_dict[c]: set_per_c.add(uf.find(i)) ans += len(set_per_c)-1 print(ans) if __name__ == "__main__": main()