結果

問題 No.2696 Sign Creation
ユーザー mo124121mo124121
提出日時 2024-02-04 09:56:32
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,764 bytes
コンパイル時間 243 ms
コンパイル使用メモリ 82,292 KB
実行使用メモリ 114,932 KB
最終ジャッジ日時 2024-05-17 18:09:13
合計ジャッジ時間 19,230 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
62,708 KB
testcase_01 AC 44 ms
55,176 KB
testcase_02 AC 53 ms
63,180 KB
testcase_03 AC 59 ms
68,380 KB
testcase_04 AC 51 ms
63,412 KB
testcase_05 AC 65 ms
69,020 KB
testcase_06 AC 45 ms
55,676 KB
testcase_07 AC 43 ms
55,240 KB
testcase_08 AC 219 ms
77,932 KB
testcase_09 AC 65 ms
72,104 KB
testcase_10 AC 152 ms
78,156 KB
testcase_11 AC 83 ms
77,040 KB
testcase_12 AC 85 ms
76,996 KB
testcase_13 TLE -
testcase_14 AC 816 ms
93,732 KB
testcase_15 AC 797 ms
91,720 KB
testcase_16 AC 2,399 ms
92,376 KB
testcase_17 AC 85 ms
77,180 KB
testcase_18 AC 333 ms
82,656 KB
testcase_19 AC 864 ms
92,336 KB
testcase_20 AC 96 ms
77,336 KB
testcase_21 AC 523 ms
95,588 KB
testcase_22 AC 536 ms
83,364 KB
testcase_23 AC 696 ms
94,332 KB
testcase_24 AC 698 ms
93,596 KB
testcase_25 AC 1,197 ms
91,576 KB
testcase_26 AC 218 ms
78,512 KB
testcase_27 AC 693 ms
85,140 KB
testcase_28 AC 620 ms
86,260 KB
testcase_29 AC 112 ms
76,868 KB
testcase_30 AC 129 ms
77,752 KB
testcase_31 TLE -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

sys.setrecursionlimit(2 * 10**3)

if sys.implementation.name == "pypy":
    import pypyjit

    pypyjit.set_param("max_unroll_recursion=-1")


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)

cand = set()
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
        cand.add(conv(xn, yn))
        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 pos in cand:
    x, y = rev(pos)
    seen = set()
    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
        seen.add(uf.root(star[posn]))
    c = count + 1
    for s in seen:
        if is_seiza[s]:
            c -= 1
    mi = min(mi, c)
    ma = max(ma, c)
print(mi, ma)
0