-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patha58_q3_p3_PandG.py
117 lines (97 loc) · 2.09 KB
/
a58_q3_p3_PandG.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
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
N = int(input())
for I in range(N):
R,C,n,T,r,c = [int(i) for i in input().split()]
M = [ [0]*C for i in range(R) ]
queue1 = []
g = []
for i in range(n):
t,a,b = [int(i) for i in input().split()]
g.append((t,a,b))
#queue1.append( (a,b) )
for i in range(R):
st = input()
for j in range(len(st)):
if st[j] == "#":
M[i][j] = 5
queue2 = [(r,c)]
ut = 0
while True:
if T < 0:
break
#print(T)
for i in g:
if ut == i[0]:
queue1.append( (i[1],i[2]) )
newQueue1 = []
newQueue2 = []
for p in queue1:
if M[ p[0] ][ p[1] ] == 0 or M[ p[0] ][ p[1] ] == 2:
M[ p[0] ][ p[1] ] = 1
#if p[0]+1 >= R:
newQueue1.append( ( min(p[0]+1,R-1),p[1] ) )
newQueue1.append( ( p[0],min(p[1]+1,C-1) ) )
newQueue1.append( ( max(0,p[0]-1),p[1] ) )
newQueue1.append( ( p[0],max(p[1]-1,0) ) )
for p in queue2:
if M[ p[0] ][ p[1] ] == 0:
M[ p[0] ][ p[1] ] = 2
newQueue2.append( ( min(p[0]+1,R-1),p[1] ) )
newQueue2.append( ( p[0],min(p[1]+1,C-1) ) )
newQueue2.append( ( max(0,p[0]-1),p[1] ) )
newQueue2.append( ( p[0],max(p[1]-1,0) ) )
queue1 = newQueue1
queue2 = newQueue2
T -= 1
ut += 1
f = False
for i in range(R):
for j in range(C):
if M[i][j]==2:
print("YES")
f = True
break
if f==True:
break
if f==False:
print("NO")
#print(M)
'''
2
5 5 2 10 2 2
0 0 0
0 4 4
.....
.###.
.#.#.
.###.
.....
5 5 2 4 2 2
0 0 0
0 4 4
.....
.###.
...#.
.###.
.....
3
2 5 1 1 0 2
0 0 2
.....
.....
2 5 1 1 0 2
1 0 2
.....
.....
2 5 4 1 0 2
1 0 2
1 0 3
1 0 1
1 1 2
.....
.....
1
2 5 1 1 0 2
1 0 2
.....
.....
'''