-
Notifications
You must be signed in to change notification settings - Fork 0
/
blocked_pipeline.py
45 lines (41 loc) · 1.37 KB
/
blocked_pipeline.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
"""
https://binarysearch.com/room/Weekly-Contest-54-lcf4Qws6iH?questionsetIndex=2
"""
import numpy as np
class Solution:
def solve(self, n, requests):
m = []
for i in range(2):
m.append([0] * n)
final_sum = 0
is_blocked = False
print(np.array(m))
for val in requests:
print("\n----------------------------------------")
print(val)
if (val[2] == 1):
if m[not val[0]][val[1]] == 1:
is_blocked = True
if val[1] > 0:
if (m[not val[0]][val[1] - 1] == 1):
is_blocked = True
if val[1] < n - 1:
if (m[not val[0]][val[1] + 1] == 1):
is_blocked = True
else:
if m[val[0]][val[1]] == 1:
is_blocked = False
m[val[0]][val[1]] = val[2]
print(np.array(m))
if (m[0][0] == 1 and m[1][0] == 1) \
or (m[0][n-1] == 1 and m[1][n-1] == 1):
continue
if not is_blocked:
final_sum += 1
print("Blocked?: {} Sum: {}".format(is_blocked, final_sum))
return final_sum
if __name__ == '__main__':
n = 6
requests = [[1,1,1],[0,0,1],[0,1,1],[0,1,0]]
sol = Solution().solve(n, requests)
print(sol)