結果

問題 No.2696 Sign Creation
ユーザー mo124121mo124121
提出日時 2024-02-04 10:34:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,087 ms / 2,500 ms
コード長 2,941 bytes
コンパイル時間 134 ms
コンパイル使用メモリ 82,532 KB
実行使用メモリ 96,284 KB
最終ジャッジ日時 2024-05-17 18:09:45
合計ジャッジ時間 9,934 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
63,464 KB
testcase_01 AC 46 ms
63,880 KB
testcase_02 AC 39 ms
56,068 KB
testcase_03 AC 43 ms
61,236 KB
testcase_04 AC 41 ms
56,512 KB
testcase_05 AC 45 ms
62,316 KB
testcase_06 AC 38 ms
55,352 KB
testcase_07 AC 38 ms
55,672 KB
testcase_08 AC 135 ms
78,168 KB
testcase_09 AC 61 ms
69,672 KB
testcase_10 AC 136 ms
78,076 KB
testcase_11 AC 68 ms
73,428 KB
testcase_12 AC 69 ms
71,840 KB
testcase_13 AC 631 ms
83,312 KB
testcase_14 AC 425 ms
83,744 KB
testcase_15 AC 377 ms
84,080 KB
testcase_16 AC 581 ms
83,068 KB
testcase_17 AC 247 ms
76,700 KB
testcase_18 AC 240 ms
78,812 KB
testcase_19 AC 408 ms
81,844 KB
testcase_20 AC 100 ms
76,752 KB
testcase_21 AC 314 ms
85,028 KB
testcase_22 AC 375 ms
78,512 KB
testcase_23 AC 412 ms
83,156 KB
testcase_24 AC 373 ms
82,288 KB
testcase_25 AC 458 ms
80,644 KB
testcase_26 AC 316 ms
77,848 KB
testcase_27 AC 322 ms
77,972 KB
testcase_28 AC 249 ms
78,344 KB
testcase_29 AC 312 ms
76,612 KB
testcase_30 AC 276 ms
77,724 KB
testcase_31 AC 1,087 ms
96,284 KB
testcase_32 AC 45 ms
61,884 KB
testcase_33 AC 55 ms
68,772 KB
testcase_34 AC 47 ms
64,132 KB
testcase_35 AC 41 ms
55,304 KB
testcase_36 AC 39 ms
55,356 KB
testcase_37 AC 38 ms
54,628 KB
testcase_38 AC 38 ms
55,372 KB
testcase_39 AC 38 ms
56,332 KB
testcase_40 AC 37 ms
54,388 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

input = lambda: sys.stdin.readline().rstrip()
from collections import defaultdict


class UnionFind:
    def __init__(self, N):
        self.N = N
        self.parent_or_size = [-1] * N
        self.group_count = N

    def root(self, x):
        if self.parent_or_size[x] < 0:
            return x
        else:
            self.parent_or_size[x] = self.root(self.parent_or_size[x])
            return self.parent_or_size[x]

    def unite(self, x, y):
        root_x = self.root(x)
        root_y = self.root(y)
        if root_x == root_y:
            return
        if -self.parent_or_size[root_x] < -self.parent_or_size[root_y]:
            root_x, root_y = root_y, root_x
        self.parent_or_size[root_x] += self.parent_or_size[root_y]
        self.parent_or_size[root_y] = root_x
        self.group_count -= 1

    def same(self, x, y):
        return self.root(x) == self.root(y)

    def size(self, x):
        return -self.parent_or_size[self.root(x)]

    def groups(self):
        ret = defaultdict(list)
        for i in range(self.N):
            ret[self.root(i)].append(i)
        return [group for group in ret.values()]


input = lambda: sys.stdin.readline().rstrip()

SHIFT = 20
MASK = (1 << SHIFT) - 1


def conv(x, y):
    return x << SHIFT | y


def rev(pos):
    return pos >> SHIFT, pos & MASK


H, W, N, D = map(int, input().split())

star = {}
XY = []
for i in range(N):
    x, y = map(int, input().split())
    x -= 1
    y -= 1
    XY.append((x, y))
    star[conv(x, y)] = i

MOVES = []
for xd in range(-D, D + 1):
    for yd in range(-D, D + 1):
        d = abs(xd) + abs(yd)
        if d > D:
            continue
        MOVES.append((xd, yd))


uf = UnionFind(N)

for i, (x, y) in enumerate(XY):
    for xd, yd in MOVES:
        d = abs(xd) + abs(yd)
        if d > D:
            continue
        xn = x + xd
        yn = y + yd
        if not (0 <= xn < H and 0 <= yn < W):
            continue
        posn = conv(xn, yn)
        if posn in star:
            uf.unite(i, star[posn])

stella = uf.groups()
is_seiza = [0] * N


count = 0
for block in stella:
    if len(block) > 1:
        count += 1
        for i in block:
            is_seiza[i] = 1

mi = N
ma = 0


for x in range(H):
    for y in range(W):
        if conv(x, y) in star:
            continue
        seen = set()
        flag = False
        for xd, yd in MOVES:
            d = abs(xd) + abs(yd)
            if d > D:
                continue
            xn = x + xd
            yn = y + yd
            posn = conv(xn, yn)
            if posn not in star:
                continue
            j = uf.root(star[posn])
            if is_seiza[j]:
                seen.add(j)
            else:
                flag = True
        if seen:
            c = count - (len(seen) - 1)
        elif flag:
            c = count + 1
        else:
            c = count

        mi = min(mi, c)
        ma = max(ma, c)
print(mi, ma)
0