結果
問題 | No.2202 贅沢てりたまチキン |
ユーザー | ohana |
提出日時 | 2023-10-23 14:27:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 717 ms / 2,000 ms |
コード長 | 2,016 bytes |
コンパイル時間 | 246 ms |
コンパイル使用メモリ | 81,868 KB |
実行使用メモリ | 109,992 KB |
最終ジャッジ日時 | 2023-10-23 14:27:45 |
合計ジャッジ時間 | 7,962 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
55,732 KB |
testcase_01 | AC | 40 ms
55,732 KB |
testcase_02 | AC | 47 ms
55,732 KB |
testcase_03 | AC | 39 ms
55,732 KB |
testcase_04 | AC | 40 ms
55,732 KB |
testcase_05 | AC | 40 ms
55,732 KB |
testcase_06 | AC | 40 ms
55,732 KB |
testcase_07 | AC | 39 ms
55,732 KB |
testcase_08 | AC | 39 ms
55,732 KB |
testcase_09 | AC | 39 ms
55,732 KB |
testcase_10 | AC | 108 ms
100,516 KB |
testcase_11 | AC | 39 ms
55,732 KB |
testcase_12 | AC | 38 ms
55,732 KB |
testcase_13 | AC | 39 ms
55,732 KB |
testcase_14 | AC | 231 ms
101,112 KB |
testcase_15 | AC | 240 ms
102,220 KB |
testcase_16 | AC | 259 ms
108,516 KB |
testcase_17 | AC | 242 ms
108,520 KB |
testcase_18 | AC | 159 ms
92,860 KB |
testcase_19 | AC | 211 ms
108,424 KB |
testcase_20 | AC | 276 ms
109,656 KB |
testcase_21 | AC | 299 ms
109,992 KB |
testcase_22 | AC | 185 ms
87,644 KB |
testcase_23 | AC | 304 ms
88,524 KB |
testcase_24 | AC | 245 ms
87,276 KB |
testcase_25 | AC | 717 ms
105,664 KB |
testcase_26 | AC | 253 ms
102,548 KB |
testcase_27 | AC | 254 ms
102,548 KB |
ソースコード
from collections import deque 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 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()) A = [[] for i in range(n)] B = [None for i in range(n)] uf = UnionFind(n) for i in range(m): a, b = map(lambda x: int(x) - 1, input().split()) A[a].append(b) A[b].append(a) uf.union(a, b) ok = set() for i in range(n): if B[i] is None and not uf.find(i) in ok: B[i] = True dq = deque([i]) while dq: q = dq.popleft() for a in A[q]: if B[a] is None: B[a] = not B[q] dq.append(a) elif B[a] == B[q]: ok.add(uf.find(i)) break print("Yes" if uf.group_count() == len(ok) else "No")