結果

問題 No.2696 Sign Creation
ユーザー mo124121mo124121
提出日時 2024-02-04 10:16:09
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,845 bytes
コンパイル時間 258 ms
コンパイル使用メモリ 82,496 KB
実行使用メモリ 96,164 KB
最終ジャッジ日時 2024-05-17 18:09:27
合計ジャッジ時間 12,034 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
64,572 KB
testcase_01 AC 51 ms
64,688 KB
testcase_02 AC 44 ms
54,516 KB
testcase_03 AC 51 ms
63,196 KB
testcase_04 AC 45 ms
56,644 KB
testcase_05 AC 56 ms
64,328 KB
testcase_06 AC 44 ms
55,128 KB
testcase_07 AC 43 ms
55,596 KB
testcase_08 AC 160 ms
78,368 KB
testcase_09 AC 64 ms
68,880 KB
testcase_10 AC 154 ms
77,800 KB
testcase_11 AC 80 ms
74,180 KB
testcase_12 AC 79 ms
74,004 KB
testcase_13 AC 803 ms
83,028 KB
testcase_14 AC 499 ms
83,924 KB
testcase_15 AC 467 ms
83,920 KB
testcase_16 AC 721 ms
82,892 KB
testcase_17 AC 256 ms
76,684 KB
testcase_18 AC 270 ms
79,120 KB
testcase_19 AC 467 ms
82,100 KB
testcase_20 AC 117 ms
76,764 KB
testcase_21 AC 377 ms
85,436 KB
testcase_22 AC 433 ms
79,048 KB
testcase_23 AC 450 ms
83,124 KB
testcase_24 AC 448 ms
82,980 KB
testcase_25 AC 519 ms
81,036 KB
testcase_26 AC 345 ms
77,756 KB
testcase_27 AC 333 ms
77,748 KB
testcase_28 AC 258 ms
78,204 KB
testcase_29 AC 327 ms
76,812 KB
testcase_30 AC 293 ms
77,856 KB
testcase_31 AC 1,810 ms
96,164 KB
testcase_32 AC 49 ms
62,188 KB
testcase_33 AC 65 ms
69,756 KB
testcase_34 WA -
testcase_35 AC 43 ms
55,184 KB
testcase_36 AC 43 ms
54,992 KB
testcase_37 AC 44 ms
54,892 KB
testcase_38 AC 44 ms
55,172 KB
testcase_39 WA -
testcase_40 AC 43 ms
56,288 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())
    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 xn < 0 or yn < 0:
            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 = count
ma = count


for x in range(H):
    for y in range(W):
        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])
            flag = True
            if is_seiza[j]:
                seen.add(uf.root(j))
        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