結果
問題 | No.2696 Sign Creation |
ユーザー |
![]() |
提出日時 | 2024-03-23 00:23:19 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,631 bytes |
コンパイル時間 | 617 ms |
コンパイル使用メモリ | 82,472 KB |
実行使用メモリ | 93,968 KB |
最終ジャッジ日時 | 2024-12-20 12:37:20 |
合計ジャッジ時間 | 12,136 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 WA * 1 |
ソースコード
from collections import defaultdictclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):way=[]while True:if self.parents[x] < 0:breakelse:way.append(x)x=self.parents[x]for w in way:self.parents[w]=xreturn xdef 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_membersdef __str__(self):return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())import sysinput=sys.stdin.readlineH,W,N,D=map(int,input().split())dat=[]datset=set()dic=[[-1]*(W+10) for _ in range(H+10)]uf=UnionFind(N)for i in range(N):x,y=map(int,input().split())x-=1y-=1dat.append((x,y))datset.add((x,y))dic[x][y]=ifor x,y in dat:for i in range(D+1):lim=D-abs(i)for j in range(-lim,lim+1):if dic[x+i][y+j]!=-1:uf.union(dic[x][y],dic[x+i][y+j])small=10**9big=-10**9for i in range(H):for j in range(W):use=set()for k in range(-D,D+1):lim=D-abs(k)for t in range(-lim,lim+1):tmp=(i+k,j+t)if dic[i+k][j+t]!=-1:use.add(uf.find(dic[i+k][j+t]))flag=Falseone=0notone=0tmp=0for u in use:if -uf.parents[u]==1:one+=1else:notone+=1if notone==0:if one>0:tmp+=1else:tmp=-(notone-1)big=max(big,tmp)small=min(small,tmp)all=0#print(small,big)for idx,lis in uf.all_group_members().items():if len(lis)>1:all+=1#print(all)print(all+small,all+big)