結果
問題 | No.2696 Sign Creation |
ユーザー | 👑 tipstar0125 |
提出日時 | 2024-03-25 17:13:54 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,516 bytes |
コンパイル時間 | 251 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 101,492 KB |
最終ジャッジ日時 | 2024-03-25 17:14:08 |
合計ジャッジ時間 | 12,942 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
55,604 KB |
testcase_01 | AC | 39 ms
55,604 KB |
testcase_02 | AC | 38 ms
55,604 KB |
testcase_03 | AC | 39 ms
55,604 KB |
testcase_04 | AC | 41 ms
57,676 KB |
testcase_05 | AC | 40 ms
55,604 KB |
testcase_06 | AC | 38 ms
55,604 KB |
testcase_07 | AC | 38 ms
55,604 KB |
testcase_08 | AC | 173 ms
78,092 KB |
testcase_09 | AC | 48 ms
63,136 KB |
testcase_10 | AC | 157 ms
78,252 KB |
testcase_11 | AC | 51 ms
65,468 KB |
testcase_12 | AC | 52 ms
65,468 KB |
testcase_13 | AC | 1,298 ms
100,212 KB |
testcase_14 | AC | 526 ms
100,984 KB |
testcase_15 | AC | 484 ms
95,608 KB |
testcase_16 | AC | 1,238 ms
94,820 KB |
testcase_17 | AC | 66 ms
73,776 KB |
testcase_18 | AC | 230 ms
90,624 KB |
testcase_19 | AC | 566 ms
98,520 KB |
testcase_20 | AC | 74 ms
74,728 KB |
testcase_21 | AC | 402 ms
97,588 KB |
testcase_22 | AC | 223 ms
90,344 KB |
testcase_23 | AC | 485 ms
99,496 KB |
testcase_24 | AC | 502 ms
99,480 KB |
testcase_25 | AC | 645 ms
101,492 KB |
testcase_26 | AC | 141 ms
80,636 KB |
testcase_27 | AC | 207 ms
95,852 KB |
testcase_28 | AC | 226 ms
97,000 KB |
testcase_29 | AC | 84 ms
79,016 KB |
testcase_30 | AC | 89 ms
78,764 KB |
testcase_31 | TLE | - |
testcase_32 | AC | 40 ms
55,604 KB |
testcase_33 | AC | 43 ms
61,028 KB |
testcase_34 | AC | 53 ms
66,260 KB |
testcase_35 | AC | 39 ms
55,604 KB |
testcase_36 | AC | 38 ms
55,604 KB |
testcase_37 | AC | 38 ms
55,604 KB |
testcase_38 | AC | 38 ms
55,604 KB |
ソースコード
from collections import defaultdict,deque class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: 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: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def 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_members H,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]=i uf=UnionFind(N) INF=int(1e18) dist=[[INF for _ in range(W+1)] for _ in range(H+1)] for (x,y) in XY: used=set() dist[x][y]=0 Q=deque() Q.append((x,y)) while len(Q): i,j=Q.popleft() used.add((i,j)) if dist[i][j]==D:continue for (di,dj) in [(1,0),(-1,0),(0,1),(0,-1)]: ni=i+di nj=j+dj if 1<=ni<=H and 1<=nj<=W: if dist[i][j]+1<dist[ni][nj]: dist[ni][nj]=dist[i][j]+1 Q.append((ni,nj)) if mp[ni][nj]!=N: uf.union(mp[x][y],mp[ni][nj]) for (i,j) in used:dist[i][j]=INF cand=set() star=set() sign=set() star_cand=[set() for _ in range(N)] sign_cand=[set() for _ in range(N)] dist=[[INF for _ in range(W+1)] for _ in range(H+1)] for (x,y) in XY: root=uf.find(mp[x][y]) size=uf.size(root) if size==1:star.add(root) else:sign.add(root) used=set() dist[x][y]=0 Q=deque() Q.append((x,y)) while len(Q): i,j=Q.popleft() used.add((i,j)) if dist[i][j]==D:continue for (di,dj) in [(1,0),(-1,0),(0,1),(0,-1)]: ni=i+di nj=j+dj if 1<=ni<=H and 1<=nj<=W: if dist[i][j]+1<dist[ni][nj]: dist[ni][nj]=dist[i][j]+1 Q.append((ni,nj)) if mp[ni][nj]==N: cand.add((ni,nj)) if size==1:star_cand[root].add((ni,nj)) else:sign_cand[root].add((ni,nj)) for (i,j) in used:dist[i][j]=INF 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]+=1 for v in sign_cand: for (x,y) in v:sign_cand_cnt[x][y]+=1 inc=0 dec=0 for (x,y) in cand: if star_cand_cnt[x][y]>0 and sign_cand_cnt[x][y]==0:inc+=1 elif star_cand_cnt[x][y]==0 and sign_cand_cnt[x][y]>0:dec=max(dec,sign_cand_cnt[x][y]) mx=sign_num mn=sign_num if inc>0:mx+=1 if dec>0:mn-=dec-1 print(mn,mx)