結果
問題 | No.2696 Sign Creation |
ユーザー |
![]() |
提出日時 | 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 |
ソースコード
import sysinput = sys.stdin.readlineclass 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 xelse: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, xif self.rank[x] == self.rank[y]:self.rank[x] += 1self.par[y] = xself.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] * NU = 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] - 1SS[X[i]][Y[i]] = iL = []for a in range(-D, D + 1):for b in range(-D, D + 1):if abs(a) + abs(b) > D:continueL.append((a, b))for i in range(N):for dx, dy in L:a = X[i] + dxb = Y[i] + dyif a < 0 or a > H - 1 or b < 0 or b > W - 1:continueif SS[a][b] == -1:continueU.union(i, SS[a][b])mi, ma = 0, -10 ** 18for i in range(H):for j in range(W):if SS[i][j] != -1:continueS = set()v = 0flag = 0for dx, dy in L:a = i + dxb = j + dyif a < 0 or a > H - 1 or b < 0 or b > W - 1:continueif SS[a][b] == -1:continueind = U.find(SS[a][b])if ind in S:continueS.add(ind)if U.get_size(ind) >= 2:v -= 1else:flag = 1if v < 0:v += 1mi = min(mi, v + flag)ma = max(ma, v + flag)ans = 0S = set()for i in range(N):if U.find(i) in S:continueS.add(U.find(i))if U.get_size(i) >= 2:ans += 1print(ans + mi, ans + ma)