-
Notifications
You must be signed in to change notification settings - Fork 81
/
Queens_Attack_2.py
27 lines (23 loc) · 768 Bytes
/
Queens_Attack_2.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
#!/bin/python3
import sys
n,k = input().strip().split(' ')
n,k = [int(n),int(k)]
rQueen,cQueen = input().strip().split(' ')
rQueen,cQueen = [int(rQueen),int(cQueen)]
ObList = []
for a0 in range(k):
rObstacle,cObstacle = input().strip().split(' ')
rObstacle,cObstacle = [int(rObstacle),int(cObstacle)]
# your code goes here
ObList.append((rObstacle,cObstacle))
ObSet = set(ObList)
Delta = [(0,1),(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(1,-1),(-1,1)]
Count = 0
for shift in Delta:
Pos = (rQueen,cQueen)
while Pos[0] + shift[0] >=1 and Pos[0] + shift[0] <= n and Pos[1] + shift[1] >=1 and Pos[1] + shift[1] <= n:
Pos = (Pos[0]+shift[0],Pos[1]+shift[1])
if Pos in ObSet:
break
Count += 1
print(Count)