結果
問題 | No.1605 Matrix Shape |
ユーザー |
|
提出日時 | 2024-07-07 11:54:53 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 1,183 ms / 2,000 ms |
コード長 | 1,727 bytes |
コンパイル時間 | 177 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 37,944 KB |
最終ジャッジ日時 | 2024-07-07 11:55:15 |
合計ジャッジ時間 | 19,937 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
from collections import Counterclass UnionFind:__slots__ = ["n", "parent", "height", "size"]def __init__(self, n):self.n = nself.parent = [i for i in range(n)]self.height = [1] * nself.size = [1] * ndef find(self, x):if self.parent[x] == x:return xelse:self.parent[x] = self.find(self.parent[x])return self.parent[x]def unite(self, x, y):x = self.find(x)y = self.find(y)if x != y:if self.height[x] < self.height[y]:self.parent[x] = yself.size[y] += self.size[x]else:self.parent[y] = xself.size[x] += self.size[y]if self.height[x] == self.height[y]:self.height[x] += 1def issame(self, x, y):return self.find(x) == self.find(y)def group_size(self, x):return self.size[self.find(x)]def group_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.parent) if i == x]def group_count(self):return len(self.roots())N = int(input())MAX = 2 * 10**5deg = [0] * MAXst = set()uf = UnionFind(MAX)for _ in range(N):H, W = (int(x) - 1 for x in input().split())deg[H] += 1deg[W] -= 1uf.unite(H, W)st.add(H)st.add(W)# 連結かif len(set(uf.find(x) for x in st)) == 1:ct = Counter(deg)if ct[0] == MAX:print(len(st))elif ct[0] == MAX - 2 and ct[-1] == ct[1] == 1:print(1)else:print(0)else:print(0)