結果
問題 | No.2696 Sign Creation |
ユーザー |
![]() |
提出日時 | 2024-03-22 22:48:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 725 ms / 2,500 ms |
コード長 | 2,340 bytes |
コンパイル時間 | 441 ms |
コンパイル使用メモリ | 82,324 KB |
実行使用メモリ | 104,972 KB |
最終ジャッジ日時 | 2024-12-20 12:17:00 |
合計ジャッジ時間 | 13,458 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
from collections import defaultdictclass UnionFind():def __init__(self, n):self.n = nself.root = [-1]*(n+1)self.rank = [0]*(n+1)def find(self, x):if(self.root[x] < 0):return xelse:self.root[x] = self.find(self.root[x])return self.root[x]def unite(self, x, y):x = self.find(x)y = self.find(y)if(x == y):returnelif(self.rank[x] > self.rank[y]):self.root[x] += self.root[y]self.root[y] = xelse:self.root[y] += self.root[x]self.root[x] = yif(self.rank[x] == self.rank[y]):self.rank[y] += 1def same(self, x, y):return self.find(x) == self.find(y)def size(self, x):return -self.root[self.find(x)]def roots(self):return [i for i, x in enumerate(self.root) if x < 0]def group_size(self):return len(self.roots())def group_members(self):group_members = defaultdict(list)for member in range(self.n):group_members[self.find(member)].append(member)return group_membersH,W,N,D = map(int,input().split())star = [[0 for j in range(W+1000)] for i in range(H+1000)]SS = []for i in range(N):x,y = map(int,input().split())star[x][y] = i+1SS.append((x,y))uf = UnionFind(N)for i in range(N):u = i + 1x,y = SS[i]for dh in range(-5,6):for dw in range(-5,6):if abs(dh) + abs(dw) > D:continuev = star[x+dh][y+dw]if v == 0:continueuf.unite(u,v)R = [0 for i in range(N+1)]for u in range(1,N+1):r = uf.find(u)R[r] += 1size = 0for i in range(N+1):if R[i] > 1:size += 1M = 0m = Nfor h in range(1,H+1):for w in range(1,W+1):if star[h][w]:continueS = set()for dh in range(-5,6):for dw in range(-5,6):if abs(dh) + abs(dw) > D:continueif star[h+dh][w+dw] > 0:v = star[h+dh][w+dw]r = uf.find(v)S.add(r)S = list(S)s = 0f = 0for r in S:if R[r] == 1:f = 1continues += 1if s > 0:s = s - 1else:s = -fm = min(size - s,m)M = max(size - s,M)print(m,M)