#963994 (PyPy3) No.2696 Sign Creation

• 問題: No.2696 Sign Creation
• ユーザー: mymelochan
• 提出日時: 2024-03-22 22:13:29
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 838 ms / 2,500 ms
• コード長: 2,569 bytes
• コンパイル時間: 352 ms
• コンパイル使用メモリ: 82,276 KB
• 実行使用メモリ: 93,840 KB
• 最終ジャッジ日時: 2024-12-20 11:59:27
• 合計ジャッジ時間: 12,294 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 38

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#############################################################
import sys
sys.setrecursionlimit(10**7)
from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
ipt = sys.stdin.readline
def iin():
    return int(ipt())
def lmin():
    return list(map(int,ipt().split()))
class dsu:
    def __init__(self,n):
        self.N = n
        self.cnt=[1]*self.N
        self.root=list(range(self.N))
        self.components = self.N
    def unite(self,x,y):
        x=self.leader(x)
        y=self.leader(y)
        if x!=y:
            self.components -= 1
            if self.cnt[x]<self.cnt[y]:
                x,y=y,x
            self.cnt[x]+=self.cnt[y]
            self.root[y]=x
            return x
        return None
    def leader(self,x):
        if self.root[x]==x:
            return x
        self.root[x]=self.leader(self.root[x])
        return self.root[x]
MOD = 998244353
#############################################################
H,W,N,D = lmin()
A = [[-1]*W for _ in range(H)]
L = [lmin() for _ in range(N)]
for i,(x,y) in enumerate(L):
    x,y = x-1,y-1
    A[x][y] = i
uf = dsu(N)
for idx,(x,y) in enumerate(L):
    x,y = x-1,y-1
    for i in range(x-D,x+D+1):
        for j in range(y-D,y+D+1):
            if abs(x-i)+abs(y-j) > D:
                continue
            if 0 <= i < H and 0 <= j < W:
                if A[i][j] != -1:
                    uf.unite(A[i][j],idx)
S = set()
T = set()
for i in range(N):
    l = uf.leader(i)
    if uf.cnt[l] == 1:
        T.add(l)
    else:
        S.add(l)
tmp = len(S)
#print(S,T)
ma = 0
mi = 1<<30
for x in range(H):
    for y in range(W):
        if A[x][y] != -1:
            continue
        
        ss = set()
        tt = set()
        for i in range(x-D,x+D+1):
            for j in range(y-D,y+D+1):
                if abs(x-i)+abs(y-j) > D:
                    continue
                if 0 <= i < H and 0 <= j < W:
                    if A[i][j] != -1:
                        l = uf.leader(A[i][j])
                        if l in S:
                            ss.add(l)
                        else:
                            tt.add(l)
        if not ss:
            if tt:
                ma = max(ma, tmp+1)
                mi = min(mi, tmp+1)
            else:
                ma = max(ma, tmp)
                mi = min(mi, tmp)
        else:
            ma = max(ma, tmp-len(ss)+1)
            mi = min(mi, tmp-len(ss)+1)
print(mi,ma)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX