結果

問題 No.1605 Matrix Shape
ユーザー horitaka1999
提出日時 2021-07-17 12:46:16
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 655 ms / 2,000 ms
コード長 2,125 bytes
コンパイル時間 175 ms
コンパイル使用メモリ 82,204 KB
実行使用メモリ 163,136 KB
最終ジャッジ日時 2024-07-07 00:27:24
合計ジャッジ時間 8,842 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 = int(input())
uf = UnionFind(4*10**5)
from collections import defaultdict
Euler = defaultdict(int)
hw = set()
for _ in range(N):
    h,w = map(int,input().split())
    h-=1
    w-=1
    if h in Euler.keys():
        Euler[h] += 1
    else:
        Euler[h] = 1
    if w in Euler.keys():
        Euler[w] -=1
    else:
        Euler[w] = -1
    hw.add(h)
    hw.add(w)
    uf.union(h,w)
if hw == set(uf.members(list(hw)[0])):
    cnt0 = 0
    cnt1 = 0
    cntminus = 0
    for key in Euler.keys():
        if Euler[key] == 0:
            cnt0 += 1
        if Euler[key] == 1:
            cnt1 += 1
        if Euler[key] == -1:
            cntminus += 1
    V = len(Euler.keys())
    if cnt0 == V:
        print(V)
    elif cnt0 == V -2 and cnt1 == 1 and cntminus == 1:
        print(1)
    else:
        print(0)
else:
    print(0)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0