結果

問題 No.2696 Sign Creation
ユーザー 👑 tipstar0125tipstar0125
提出日時 2024-03-25 17:07:43
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,477 bytes
コンパイル時間 293 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 117,332 KB
最終ジャッジ日時 2024-03-25 17:07:58
合計ジャッジ時間 13,821 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
55,600 KB
testcase_01 AC 42 ms
55,600 KB
testcase_02 AC 43 ms
55,600 KB
testcase_03 AC 42 ms
55,600 KB
testcase_04 AC 42 ms
55,600 KB
testcase_05 AC 45 ms
55,600 KB
testcase_06 AC 45 ms
55,600 KB
testcase_07 AC 41 ms
55,600 KB
testcase_08 AC 179 ms
78,084 KB
testcase_09 AC 48 ms
63,144 KB
testcase_10 AC 182 ms
78,292 KB
testcase_11 AC 50 ms
63,276 KB
testcase_12 AC 66 ms
63,276 KB
testcase_13 AC 1,436 ms
109,748 KB
testcase_14 AC 588 ms
113,348 KB
testcase_15 AC 570 ms
103,716 KB
testcase_16 AC 1,283 ms
102,532 KB
testcase_17 AC 63 ms
72,500 KB
testcase_18 AC 264 ms
96,360 KB
testcase_19 AC 659 ms
110,272 KB
testcase_20 AC 80 ms
77,296 KB
testcase_21 AC 452 ms
102,696 KB
testcase_22 AC 262 ms
98,092 KB
testcase_23 AC 599 ms
113,612 KB
testcase_24 AC 572 ms
113,864 KB
testcase_25 AC 770 ms
117,332 KB
testcase_26 AC 146 ms
81,872 KB
testcase_27 AC 244 ms
109,040 KB
testcase_28 AC 303 ms
114,592 KB
testcase_29 AC 86 ms
79,036 KB
testcase_30 AC 92 ms
78,772 KB
testcase_31 TLE -
testcase_32 AC 40 ms
55,600 KB
testcase_33 AC 43 ms
61,028 KB
testcase_34 AC 52 ms
64,164 KB
testcase_35 AC 39 ms
55,600 KB
testcase_36 AC 39 ms
55,600 KB
testcase_37 AC 39 ms
55,600 KB
testcase_38 AC 39 ms
55,600 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=defaultdict(set)
sign_cand=defaultdict(set)
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=defaultdict(int)
sign_cand_cnt=defaultdict(int)
for (k,v) in star_cand.items():
    for x in v:star_cand_cnt[x]+=1
for (k,v) in sign_cand.items():
    for x in v:sign_cand_cnt[x]+=1

inc=0
dec=0
for c in cand:
    if star_cand_cnt.get(c) is not None and sign_cand_cnt.get(c) is None:inc+=1
    elif star_cand_cnt.get(c) is None and sign_cand_cnt.get(c) is not None:dec=max(dec,sign_cand_cnt[c])

mx=sign_num
mn=sign_num
if inc>0:mx+=1
if dec>0:mn-=dec-1

print(mn,mx)
0