結果

問題 No.1605 Matrix Shape
ユーザー KudeKude
提出日時 2021-07-16 21:54:17
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 561 ms / 2,000 ms
コード長 2,926 bytes
コンパイル時間 192 ms
コンパイル使用メモリ 82,504 KB
実行使用メモリ 141,912 KB
最終ジャッジ日時 2024-07-06 09:01:14
合計ジャッジ時間 10,357 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
79,104 KB
testcase_01 AC 63 ms
80,668 KB
testcase_02 AC 63 ms
78,720 KB
testcase_03 AC 64 ms
79,812 KB
testcase_04 AC 67 ms
80,408 KB
testcase_05 AC 68 ms
80,160 KB
testcase_06 AC 67 ms
79,724 KB
testcase_07 AC 64 ms
79,284 KB
testcase_08 AC 66 ms
80,256 KB
testcase_09 AC 66 ms
79,720 KB
testcase_10 AC 65 ms
79,900 KB
testcase_11 AC 66 ms
80,636 KB
testcase_12 AC 66 ms
79,660 KB
testcase_13 AC 65 ms
80,700 KB
testcase_14 AC 64 ms
79,704 KB
testcase_15 AC 67 ms
79,604 KB
testcase_16 AC 67 ms
79,556 KB
testcase_17 AC 65 ms
79,024 KB
testcase_18 AC 65 ms
79,252 KB
testcase_19 AC 561 ms
141,912 KB
testcase_20 AC 535 ms
125,064 KB
testcase_21 AC 514 ms
123,664 KB
testcase_22 AC 418 ms
122,628 KB
testcase_23 AC 547 ms
139,908 KB
testcase_24 AC 540 ms
141,452 KB
testcase_25 AC 305 ms
108,936 KB
testcase_26 AC 289 ms
108,688 KB
testcase_27 AC 301 ms
108,656 KB
testcase_28 AC 293 ms
108,044 KB
testcase_29 AC 336 ms
108,804 KB
testcase_30 AC 545 ms
128,016 KB
testcase_31 AC 525 ms
125,580 KB
testcase_32 AC 396 ms
119,408 KB
testcase_33 AC 398 ms
119,296 KB
testcase_34 AC 278 ms
122,428 KB
testcase_35 AC 360 ms
137,808 KB
testcase_36 AC 236 ms
113,540 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import types

_atcoder_code = """
# Python port of AtCoder Library.

__version__ = '0.0.1'
"""

atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)

_atcoder_dsu_code = """
import typing


class DSU:
    '''
    Implement (union by size) + (path halving)

    Reference:
    Zvi Galil and Giuseppe F. Italiano,
    Data structures and algorithms for disjoint set union problems
    '''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a: int, b: int) -> int:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        x = self.leader(a)
        y = self.leader(b)

        if x == y:
            return x

        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x

        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x

        return x

    def same(self, a: int, b: int) -> bool:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        return self.leader(a) == self.leader(b)

    def leader(self, a: int) -> int:
        assert 0 <= a < self._n

        parent = self.parent_or_size[a]
        while parent >= 0:
            if self.parent_or_size[parent] < 0:
                return parent
            self.parent_or_size[a], a, parent = (
                self.parent_or_size[parent],
                self.parent_or_size[parent],
                self.parent_or_size[self.parent_or_size[parent]]
            )

        return a

    def size(self, a: int) -> int:
        assert 0 <= a < self._n

        return -self.parent_or_size[self.leader(a)]

    def groups(self) -> typing.List[typing.List[int]]:
        leader_buf = [self.leader(i) for i in range(self._n)]

        result: typing.List[typing.List[int]] = [[] for _ in range(self._n)]
        for i in range(self._n):
            result[leader_buf[i]].append(i)

        return list(filter(lambda r: r, result))
"""

atcoder.dsu = types.ModuleType('atcoder.dsu')
exec(_atcoder_dsu_code, atcoder.dsu.__dict__)
DSU = atcoder.dsu.DSU

# from atcoder.dsu import DSU
m = int(input())
n = 2 * 10 ** 5
deg = [0] * n
deg = [0] * n
to = [[] for _ in range(n)]
hw = [tuple(x - 1 for x in map(int, input().split())) for _ in range(m)]
for h, w in hw:
    to[h].append(w)
    deg[h] += 1
    deg[w] -= 1

d = DSU(n)
for i in range(n):
    for j in to[i]:
        d.merge(i, j)
x = hw[0][0]
s = set()
for h, w in hw: 
    if not (d.same(h, x) and d.same(w, x)):
        print(0)
        exit()
    s.add(h)
    s.add(w)

if not any(deg):
    print(len(s))
else:
    cnt0 = cnt1 = 0
    x = y = -1
    for i, d in enumerate(deg):
        if d == 0:
            continue
        elif d == 1:
            cnt0 += 1
        elif d == -1:
            cnt1 += 1
        else:
            cnt0 = 55
            break
    if cnt0 == cnt1 == 1:
        print(1)
    else:
        print(0)
0