結果

問題 No.2696 Sign Creation
ユーザー tipstar0125tipstar0125
提出日時 2024-03-25 17:32:36
言語 PyPy3
(7.3.15)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 2,969 bytes
コンパイル時間 159 ms
コンパイル使用メモリ 82,284 KB
実行使用メモリ 107,320 KB
最終ジャッジ日時 2024-05-17 18:25:27
合計ジャッジ時間 7,586 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
55,340 KB
testcase_01 AC 42 ms
55,296 KB
testcase_02 AC 42 ms
55,320 KB
testcase_03 AC 44 ms
56,220 KB
testcase_04 AC 43 ms
56,000 KB
testcase_05 AC 44 ms
56,456 KB
testcase_06 AC 44 ms
56,520 KB
testcase_07 AC 43 ms
55,736 KB
testcase_08 AC 117 ms
78,156 KB
testcase_09 AC 48 ms
61,164 KB
testcase_10 AC 118 ms
78,068 KB
testcase_11 AC 50 ms
63,256 KB
testcase_12 AC 50 ms
62,972 KB
testcase_13 AC 575 ms
107,320 KB
testcase_14 AC 352 ms
99,964 KB
testcase_15 AC 334 ms
94,960 KB
testcase_16 AC 526 ms
99,244 KB
testcase_17 AC 54 ms
65,944 KB
testcase_18 AC 163 ms
89,816 KB
testcase_19 AC 350 ms
101,312 KB
testcase_20 AC 61 ms
68,520 KB
testcase_21 AC 341 ms
98,820 KB
testcase_22 AC 159 ms
90,776 KB
testcase_23 AC 379 ms
99,068 KB
testcase_24 AC 333 ms
98,660 KB
testcase_25 AC 386 ms
105,096 KB
testcase_26 AC 99 ms
78,916 KB
testcase_27 AC 149 ms
98,864 KB
testcase_28 AC 166 ms
99,300 KB
testcase_29 AC 66 ms
69,628 KB
testcase_30 AC 67 ms
70,984 KB
testcase_31 AC 602 ms
97,012 KB
testcase_32 AC 43 ms
56,176 KB
testcase_33 AC 49 ms
60,744 KB
testcase_34 AC 53 ms
62,276 KB
testcase_35 AC 41 ms
55,136 KB
testcase_36 AC 42 ms
55,956 KB
testcase_37 AC 42 ms
56,332 KB
testcase_38 AC 41 ms
55,424 KB
testcase_39 WA -
testcase_40 AC 44 ms
55,744 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

dist=defaultdict(int)
dist[(0,0)]=0
Q=deque()
Q.append((0,0))
while len(Q):
    i,j=Q.popleft()
    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 dist.get((ni,nj)) is None or dist[(i,j)]+1<dist[(ni,nj)]:
            dist[(ni,nj)]=dist[(i,j)]+1
            Q.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+di
        nj=j+dj
        if 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+di
        nj=j+dj
        if 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]+=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)
0