-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patha59_q3_hole.py
71 lines (59 loc) · 1.31 KB
/
a59_q3_hole.py
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
import sys
input = sys.stdin.readline
def BFS(V,q,r,c):
h = 0
while len(q)!=0:
newQ = []
for i,j in q:
if V[i][j] != 0:
if V[i][j]==2:
newQ.append((i,j))
continue
V[i][j] = 1
if i == 0 or i == r-1 or j == 0 or j == c-1:
print(h)
return
if V[i-1][j] != 1:
newQ.append( (i-1,j) )
if V[i][j-1] != 1:
newQ.append( (i,j-1) )
if V[i+1][j] != 1:
newQ.append( (i+1,j) )
if V[i][j+1] != 1:
newQ.append( (i,j+1) )
if len(newQ)==0:
break
flag = False
for cx,cy in newQ:
if V[cx][cy]==0:
flag = True
break
if flag == False:
h+=1
for cx,cy in newQ:
if V[cx][cy]==2:
V[cx][cy] = 0
q = newQ
print(h)
N,a,b = [int(i) for i in input().split()]
a-=1
b-=1
r=1000
c=1000
V = [ [0]*c for i in range(r) ]
for i in range(N):
ir,ic = [int(i)-1 for i in input().split()]
V[ir][ic] = 2
q = [(a,b)]
BFS(V,q,r,c)
#print(h)
'''
7 6 3
6 2
5 2
4 3
2 1
7 3
5 4
6 4
'''