結果

問題 No.1605 Matrix Shape
ユーザー 👑 SPD_9X2
提出日時 2021-04-25 21:26:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 354 ms / 2,000 ms
コード長 2,150 bytes
コンパイル時間 147 ms
コンパイル使用メモリ 82,236 KB
実行使用メモリ 101,840 KB
最終ジャッジ日時 2024-07-06 07:50:28
合計ジャッジ時間 8,340 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

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

"""
ver_1.0
H*W H-W
0
-
+1 , -1 1 0 1
0
0
"""
import sys
from sys import stdin
def uf_find(n,p):
ufl = []
while p[n] != n:
ufl.append(n)
n = p[n]
for i in ufl:
p[i] = n
return n
def uf_union(a,b,p,rank):
ap = uf_find(a,p)
bp = uf_find(b,p)
if ap == bp:
return False
else:
if rank[ap] > rank[bp]:
p[bp] = ap
elif rank[ap] < rank[bp]:
p[ap] = bp
else:
p[bp] = ap
rank[ap] += 1
return True
N = int(stdin.readline())
assert 2 <= N <= 2*(10**5)
in_num = {} #
merge_num = 0 #uf
p = [i for i in range(200001)]
rank = [0] * (200001)
for i in range(N):
H,W = map(int,stdin.readline().split())
assert 1 <= H <= 2*(10**5)
assert 1 <= W <= 2*(10**5)
if H not in in_num:
in_num[H] = 0
if W not in in_num:
in_num[W] = 0
#
in_num[H] -= 1
in_num[W] += 1
#union-find
if uf_union(H,W,p,rank):
merge_num += 1
num_0 = 0 #0
num_1 = 0 #1
num_minus_1 = 0 #-1
num_other = 0 #
for i in in_num:
if in_num[i] == 0:
num_0 += 1
elif in_num[i] == 1:
num_1 += 1
elif in_num[i] == -1:
num_minus_1 += 1
else:
num_other += 1
#
#0
if merge_num != len(in_num)-1:
print (0)
sys.exit()
#0,-1,10
if num_other > 0:
print (0)
sys.exit()
#-1,11 1
if num_1 == 1 and num_minus_1 == 1:
print (1)
sys.exit()
#0
if num_1 == 0 and num_1 == 0 and num_minus_1 == 0:
print (num_0)
sys.exit()
#0
print (0)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0