#964482 (PyPy3) No.2696 Sign Creation

• 問題: No.2696 Sign Creation
• ユーザー: nikoro256
• 提出日時: 2024-03-23 00:00:55
• 言語: PyPy3 (7.3.15)
• 結果: TLE
• 実行時間: -
• コード長: 2,792 bytes
• コンパイル時間: 348 ms
• コンパイル使用メモリ: 81,956 KB
• 実行使用メモリ: 88,376 KB
• 最終ジャッジ日時: 2024-12-20 12:36:37
• 合計ジャッジ時間: 17,216 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 36 WA * 1 TLE * 1

ソースコード

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
115
116
117
118
119
120
from collections import defaultdict
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        way=[]
        while True:
            if self.parents[x] < 0:
                break
            else:
                way.append(x)
                x=self.parents[x]
        for w in way:
            self.parents[w]=x
        return 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
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
    
import sys
input=sys.stdin.readline
H,W,N,D=map(int,input().split())
dat=[]
datset=set()
dic=[[-1]*W for _ in range(H)]
uf=UnionFind(N)
for i in range(N):
    x,y=map(int,input().split())
    x-=1
    y-=1
    dat.append((x,y))
    datset.add((x,y))
    dic[x][y]=i
for x,y in dat:
    for i in range(D+1):
        lim=D-abs(i)
        for j in range(-lim,lim+1):
            if abs(i)+abs(j)>D:
                continue
            if (x+i,y+j) in datset:
                uf.union(dic[x][y],dic[x+i][y+j])
root={}
for a in datset:
    root[a]=uf.find(dic[a[0]][a[1]])
small=10**9
big=-10**9
for i in range(H):
    for j in range(W):
        use=set()
        for k in range(-D,D+1):
            lim=D-abs(k)
            for t in range(-lim,lim+1):
                if abs(k)+abs(t)>D:
                    continue
                tmp=(i+k,j+t)
                if tmp in datset:
                    use.add(root[tmp])
        flag=False
        one=0
        notone=0
        tmp=0
        for u in use:
            if -uf.parents[u]==1:
                one+=1
            else:
                notone+=1
        if notone==0:
            if one>0:
                tmp+=1
        else:
            tmp=-(notone-1)
        big=max(big,tmp)
        small=min(small,tmp)
all=0
#print(small,big)
for idx,lis in uf.all_group_members().items():
    if len(lis)>1:
        all+=1
#print(all)
print(all+small,all+big)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX