#993020 (Python3) No.1605 Matrix Shape

• 問題: No.1605 Matrix Shape
• ユーザー: H3PO4
• 提出日時: 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

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
from collections import Counter
class UnionFind:
    __slots__ = ["n", "parent", "height", "size"]
    def __init__(self, n):
        self.n = n
        self.parent = [i for i in range(n)]
        self.height = [1] * n
        self.size = [1] * n
    def find(self, x):
        if self.parent[x] == x:
            return x
        else:
            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] = y
                self.size[y] += self.size[x]
            else:
                self.parent[y] = x
                self.size[x] += self.size[y]
                if self.height[x] == self.height[y]:
                    self.height[x] += 1
    def 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**5
deg = [0] * MAX
st = set()
uf = UnionFind(MAX)
for _ in range(N):
    H, W = (int(x) - 1 for x in input().split())
    deg[H] += 1
    deg[W] -= 1
    uf.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)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX