結果
問題 | No.2202 贅沢てりたまチキン |
ユーザー |
![]() |
提出日時 | 2023-10-23 14:27:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 678 ms / 2,000 ms |
コード長 | 2,016 bytes |
コンパイル時間 | 298 ms |
コンパイル使用メモリ | 81,968 KB |
実行使用メモリ | 110,048 KB |
最終ジャッジ日時 | 2024-09-22 10:06:54 |
合計ジャッジ時間 | 6,875 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
from collections import dequefrom collections import defaultdictclass UnionFind:def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):if self.parents[x] < 0:return xelse: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:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xdef 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_membersdef __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] = Truedq = 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))breakprint("Yes" if uf.group_count() == len(ok) else "No")