結果

問題 No.2696 Sign Creation
ユーザー rlangevinrlangevin
提出日時 2024-03-22 22:29:37
言語 PyPy3
(7.3.15)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 2,413 bytes
コンパイル時間 433 ms
コンパイル使用メモリ 82,136 KB
実行使用メモリ 82,708 KB
最終ジャッジ日時 2024-12-20 12:07:35
合計ジャッジ時間 7,695 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 37 WA * 1
権限があれば一括ダウンロードができます

ソースコード

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

import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
self.par[y] = x
self.size[x] += self.size[y]
def is_same(self, x, y):
return self.find(x) == self.find(y)
def get_size(self, x):
x = self.find(x)
return self.size[x]
H, W, N, D = map(int, input().split())
X, Y = [0] * N, [0] * N
U = UnionFind(N)
SS = [[-1] * (W + 1) for _ in range(H + 1)]
for i in range(N):
X[i], Y[i] = map(int, input().split())
X[i], Y[i] = X[i] - 1, Y[i] - 1
SS[X[i]][Y[i]] = i
L = []
for a in range(-D, D + 1):
for b in range(-D, D + 1):
if abs(a) + abs(b) > D:
continue
L.append((a, b))
for i in range(N):
for dx, dy in L:
a = X[i] + dx
b = Y[i] + dy
if a < 0 or a > H - 1 or b < 0 or b > W - 1:
continue
if SS[a][b] == -1:
continue
U.union(i, SS[a][b])
mi, ma = 0, -10 ** 18
for i in range(H):
for j in range(W):
if SS[i][j] != -1:
continue
S = set()
v = 0
flag = 0
for dx, dy in L:
a = i + dx
b = j + dy
if a < 0 or a > H - 1 or b < 0 or b > W - 1:
continue
if SS[a][b] == -1:
continue
ind = U.find(SS[a][b])
if ind in S:
continue
S.add(ind)
if U.get_size(ind) >= 2:
v -= 1
else:
flag = 1
if v < 0:
v += 1
mi = min(mi, v + flag)
ma = max(ma, v + flag)
ans = 0
S = set()
for i in range(N):
if U.find(i) in S:
continue
S.add(U.find(i))
if U.get_size(i) >= 2:
ans += 1
print(ans + mi, ans + ma)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0