結果
問題 | No.2696 Sign Creation |
ユーザー |
|
提出日時 | 2024-03-25 17:32:36 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,969 bytes |
コンパイル時間 | 245 ms |
コンパイル使用メモリ | 81,852 KB |
実行使用メモリ | 107,320 KB |
最終ジャッジ日時 | 2024-12-20 12:51:23 |
合計ジャッジ時間 | 9,698 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 WA * 1 |
ソースコード
from collections import defaultdict,dequeclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):if self.parents[x] < 0:return xelse:self.parents[x] = self.find(self.parents[x])return self.parents[x]def union(self, x, y):x = self.find(x)y = self.find(y)if x == y:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xdef size(self, x):return -self.parents[self.find(x)]def same(self, x, y):return self.find(x) == self.find(y)def members(self, x):root = self.find(x)return [i for i in range(self.n) if self.find(i) == root]def roots(self):return [i for i, x in enumerate(self.parents) if x < 0]def group_count(self):return len(self.roots())def all_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())XY=[tuple(map(int,input().split())) for _ in range(N)]mp=[[N for _ in range(W+1)] for _ in range(H+1)]for (i,(x,y)) in enumerate(XY):mp[x][y]=idist=defaultdict(int)dist[(0,0)]=0Q=deque()Q.append((0,0))while len(Q):i,j=Q.popleft()if dist[(i,j)]==D:continuefor (di,dj) in [(1,0),(-1,0),(0,1),(0,-1)]:ni=i+dinj=j+djif dist.get((ni,nj)) is None or dist[(i,j)]+1<dist[(ni,nj)]:dist[(ni,nj)]=dist[(i,j)]+1Q.append((ni,nj))nxt=[]for (k,v) in dist.items():if v!=0:nxt.append(k)uf=UnionFind(N)for (i,j) in XY:for (di,dj) in nxt:ni=i+dinj=j+djif 1<=ni<=H and 1<=nj<=W and mp[ni][nj]!=N:uf.union(mp[i][j],mp[ni][nj])cand=set()star=set()sign=set()star_cand=[set() for _ in range(N)]sign_cand=[set() for _ in range(N)]for (i,j) in XY:root=uf.find(mp[i][j])size=uf.size(root)if size==1:star.add(root)else:sign.add(root)for (di,dj) in nxt:ni=i+dinj=j+djif 1<=ni<=H and 1<=nj<=W and mp[ni][nj]==N:cand.add((ni,nj))if size==1:star_cand[root].add((ni,nj))else:sign_cand[root].add((ni,nj))star_num=len(star)sign_num=len(sign)star_cand_cnt=[[0 for _ in range(W+1)] for _ in range(H+1)]sign_cand_cnt=[[0 for _ in range(W+1)] for _ in range(H+1)]for v in star_cand:for (x,y) in v:star_cand_cnt[x][y]+=1for v in sign_cand:for (x,y) in v:sign_cand_cnt[x][y]+=1inc=0dec=0for (x,y) in cand:if star_cand_cnt[x][y]>0 and sign_cand_cnt[x][y]==0:inc+=1elif star_cand_cnt[x][y]==0 and sign_cand_cnt[x][y]>0:dec=max(dec,sign_cand_cnt[x][y])mx=sign_nummn=sign_numif inc>0:mx+=1if dec>0:mn-=dec-1print(mn,mx)