結果

問題 No.2696 Sign Creation
ユーザー tipstar0125tipstar0125
提出日時 2024-03-25 17:13:54
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,516 bytes
コンパイル時間 132 ms
コンパイル使用メモリ 83,108 KB
実行使用メモリ 101,600 KB
最終ジャッジ日時 2024-05-17 18:25:30
合計ジャッジ時間 11,665 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
57,024 KB
testcase_01 AC 40 ms
55,876 KB
testcase_02 AC 41 ms
55,256 KB
testcase_03 AC 39 ms
56,036 KB
testcase_04 AC 40 ms
56,520 KB
testcase_05 AC 40 ms
56,632 KB
testcase_06 AC 42 ms
56,180 KB
testcase_07 AC 41 ms
56,120 KB
testcase_08 AC 167 ms
79,004 KB
testcase_09 AC 48 ms
63,556 KB
testcase_10 AC 142 ms
78,768 KB
testcase_11 AC 49 ms
66,064 KB
testcase_12 AC 51 ms
65,476 KB
testcase_13 AC 1,185 ms
101,040 KB
testcase_14 AC 483 ms
101,600 KB
testcase_15 AC 462 ms
96,108 KB
testcase_16 AC 1,140 ms
95,504 KB
testcase_17 AC 66 ms
74,472 KB
testcase_18 AC 224 ms
91,152 KB
testcase_19 AC 525 ms
98,820 KB
testcase_20 AC 71 ms
75,476 KB
testcase_21 AC 390 ms
98,248 KB
testcase_22 AC 203 ms
91,228 KB
testcase_23 AC 467 ms
100,460 KB
testcase_24 AC 456 ms
100,492 KB
testcase_25 AC 628 ms
100,316 KB
testcase_26 AC 129 ms
81,356 KB
testcase_27 AC 190 ms
96,748 KB
testcase_28 AC 220 ms
97,908 KB
testcase_29 AC 83 ms
79,636 KB
testcase_30 AC 88 ms
79,296 KB
testcase_31 AC 2,320 ms
100,992 KB
testcase_32 AC 38 ms
57,148 KB
testcase_33 AC 44 ms
62,912 KB
testcase_34 AC 49 ms
65,552 KB
testcase_35 AC 38 ms
56,672 KB
testcase_36 AC 38 ms
56,320 KB
testcase_37 AC 38 ms
56,232 KB
testcase_38 AC 41 ms
55,236 KB
testcase_39 WA -
testcase_40 AC 39 ms
55,312 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

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)
0