-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathseating.py
125 lines (108 loc) · 3.33 KB
/
seating.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
118
119
120
121
122
123
124
125
def num_adj(r, c):
res = 0
for r_diff in range(-1, 2):
for c_diff in range(-1, 2):
if r+r_diff in range(len(grid)) and c+c_diff in range(len(grid[0])):
res += prev_grid[r+r_diff][c+c_diff] == '#'
return res - (grid[r][c] == '#')
def num_visible(r, c):
res = 0
r_orig, c_orig = r, c
r -= 1
c -= 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # TL
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
r -= 1
c -= 1
r, c = r_orig, c_orig
r -= 1
c += 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # TR
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
r -= 1
c += 1
r, c = r_orig, c_orig
r += 1
c -= 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # BL
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
r += 1
c -= 1
r, c = r_orig, c_orig
r += 1
c += 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # BR
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
r += 1
c += 1
r, c = r_orig, c_orig
r -= 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # U
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
r -= 1
r = r_orig
r += 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # D
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
r += 1
r = r_orig
c -= 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # L
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
c -= 1
c = c_orig
c += 1
finished = False
while r in range(len(grid)) and c in range(len(grid[r])) and not finished: # R
if prev_grid[r][c] != '.':
res += prev_grid[r][c] == '#'
finished = True
c += 1
c = c_orig
return res
with open('/users/sysadmin/Documents/Prajwal/Programming/Competitions/Advent of Code/input.txt') as fin:
finished = False
grid = []
while not finished:
line = fin.readline().strip()
if not line:
finished = True
else:
grid.append(list(line))
finished = False
prev_grid = [row[:] for row in grid]
while not finished:
for r in range(len(grid)):
for c in range(len(grid[r])):
if grid[r][c] == 'L' and not num_visible(r, c):
grid[r][c] = '#'
elif grid[r][c] == '#' and num_visible(r, c) >= 5:
grid[r][c] = 'L'
finished = grid == prev_grid
prev_grid = [row[:] for row in grid]
res = 0
for r in range(len(grid)):
for c in range(len(grid[r])):
res += grid[r][c] == '#'
print(res)