結果
問題 | No.2563 色ごとのグループ |
ユーザー | oginoshikibu |
提出日時 | 2023-12-02 15:25:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 571 ms / 2,000 ms |
コード長 | 2,780 bytes |
コンパイル時間 | 408 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 152,880 KB |
最終ジャッジ日時 | 2023-12-02 15:25:31 |
合計ジャッジ時間 | 9,571 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
67,724 KB |
testcase_01 | AC | 62 ms
67,724 KB |
testcase_02 | AC | 61 ms
67,724 KB |
testcase_03 | AC | 61 ms
67,724 KB |
testcase_04 | AC | 61 ms
67,724 KB |
testcase_05 | AC | 62 ms
67,724 KB |
testcase_06 | AC | 61 ms
67,724 KB |
testcase_07 | AC | 61 ms
67,724 KB |
testcase_08 | AC | 61 ms
67,724 KB |
testcase_09 | AC | 64 ms
67,724 KB |
testcase_10 | AC | 58 ms
67,724 KB |
testcase_11 | AC | 60 ms
67,724 KB |
testcase_12 | AC | 59 ms
67,724 KB |
testcase_13 | AC | 61 ms
67,724 KB |
testcase_14 | AC | 96 ms
78,256 KB |
testcase_15 | AC | 102 ms
78,392 KB |
testcase_16 | AC | 97 ms
78,256 KB |
testcase_17 | AC | 95 ms
78,256 KB |
testcase_18 | AC | 74 ms
74,052 KB |
testcase_19 | AC | 105 ms
78,392 KB |
testcase_20 | AC | 152 ms
82,612 KB |
testcase_21 | AC | 137 ms
80,312 KB |
testcase_22 | AC | 135 ms
79,684 KB |
testcase_23 | AC | 150 ms
80,320 KB |
testcase_24 | AC | 276 ms
99,164 KB |
testcase_25 | AC | 240 ms
101,568 KB |
testcase_26 | AC | 315 ms
123,764 KB |
testcase_27 | AC | 309 ms
133,036 KB |
testcase_28 | AC | 355 ms
126,072 KB |
testcase_29 | AC | 397 ms
136,660 KB |
testcase_30 | AC | 384 ms
136,140 KB |
testcase_31 | AC | 379 ms
136,208 KB |
testcase_32 | AC | 404 ms
136,148 KB |
testcase_33 | AC | 529 ms
152,464 KB |
testcase_34 | AC | 549 ms
152,876 KB |
testcase_35 | AC | 525 ms
152,880 KB |
testcase_36 | AC | 535 ms
152,468 KB |
testcase_37 | AC | 571 ms
152,468 KB |
ソースコード
import types _atcoder_code = """ # Python port of AtCoder Library. __version__ = '0.0.1' """ atcoder = types.ModuleType('atcoder') exec(_atcoder_code, atcoder.__dict__) _atcoder_dsu_code = """ import typing class DSU: ''' Implement (union by size) + (path halving) Reference: Zvi Galil and Giuseppe F. Italiano, Data structures and algorithms for disjoint set union problems ''' def __init__(self, n: int = 0) -> None: self._n = n self.parent_or_size = [-1] * n def merge(self, a: int, b: int) -> int: assert 0 <= a < self._n assert 0 <= 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: int, b: int) -> bool: assert 0 <= a < self._n assert 0 <= b < self._n return self.leader(a) == self.leader(b) def leader(self, a: int) -> int: assert 0 <= a < self._n parent = self.parent_or_size[a] while parent >= 0: if self.parent_or_size[parent] < 0: return parent self.parent_or_size[a], a, parent = ( self.parent_or_size[parent], self.parent_or_size[parent], self.parent_or_size[self.parent_or_size[parent]] ) return a def size(self, a: int) -> int: assert 0 <= a < self._n return -self.parent_or_size[self.leader(a)] def groups(self) -> typing.List[typing.List[int]]: leader_buf = [self.leader(i) for i in range(self._n)] result: typing.List[typing.List[int]] = [[] for _ in range(self._n)] for i in range(self._n): result[leader_buf[i]].append(i) return list(filter(lambda r: r, result)) """ atcoder.dsu = types.ModuleType('atcoder.dsu') exec(_atcoder_dsu_code, atcoder.dsu.__dict__) DSU = atcoder.dsu.DSU from collections import defaultdict # from atcoder.dsu import DSU n,m=map(int, input().split()) C=list(map(int, input().split())) Cnode=defaultdict(set) for i,c in enumerate(C): Cnode[c].add(i) Cedge=defaultdict(set) for _ in range(m): u,v=map(lambda x: int(x) - 1, input().split()) if C[u] == C[v]: Cedge[C[u]].add((u,v)) ans=0 for c in Cnode.keys(): if len(Cnode[c]) == 1: continue D={e:i for i,e in enumerate(Cnode[c])} dsu=DSU(len(D)) for u,v in Cedge[c]: dsu.merge(D[u],D[v]) node1=D[Cnode[c].pop()] for u in Cnode[c]: if not dsu.same(D[u],node1): dsu.merge(D[u],node1) ans+=1 print(ans)