-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy pathday11.py
executable file
·142 lines (116 loc) · 2.53 KB
/
day11.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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#!/usr/bin/env python3
from utils.all import *
advent.setup(2020, 11)
fin = advent.get_input()
# fin = io.StringIO('''\
# L.LL.LL.LL
# LLLLLLL.LL
# L.L.L..L..
# LLLL.LL.LL
# L.LL.LL.LL
# L.LLLLL.LL
# ..L.L.....
# LLLLLLLLLL
# L.LLLLLL.L
# L.LLLLL.LL
# ''')
# eprint(*fin, sep=''); fin.seek(0, 0)
timer_start()
orig_grid = read_char_matrix(fin)
grid = copy.deepcopy(orig_grid)
while 1:
prevgrid = copy.deepcopy(grid)
for r in range(len(grid)):
for c in range(len(grid[r])):
x = prevgrid[r][c]
if x == '.':
continue
neigh = ''.join(prevgrid[rr][cc] for rr,cc in neighbors8(prevgrid, r, c, avoid=''))
if x == 'L' and '#' not in neigh:
grid[r][c] = '#'
elif x == '#' and neigh.count('#') >= 4:
grid[r][c] = 'L'
# dump_char_matrix(grid)
# eprint('---')
if grid == prevgrid:
break
prevgrid = grid
ans = sum(l.count('#') for l in grid)
advent.print_answer(1, ans)
from itertools import count
def neighborswtf(grid, r, c):
width = len(grid)
height = len(grid[0])
# down
for rr in range(r + 1, width):
if grid[rr][c] != '.':
yield grid[rr][c]
break
# up
for rr in range(r - 1, -1, -1):
if grid[rr][c] != '.':
yield grid[rr][c]
break
# right
for cc in range(c + 1, height):
if grid[r][cc] != '.':
yield grid[r][cc]
break
# left
for cc in range(c - 1, -1, -1):
if grid[r][cc] != '.':
yield grid[r][cc]
break
for d in count(1):
rr, cc = r + d, c + d
if 0 <= rr < width and 0 <= cc < height:
if grid[rr][cc] != '.':
yield grid[rr][cc]
break
else:
break
for d in count(1):
rr, cc = r - d, c - d
if 0 <= rr < width and 0 <= cc < height:
if grid[rr][cc] != '.':
yield grid[rr][cc]
break
else:
break
for d in count(1):
rr, cc = r - d, c + d
if 0 <= rr < width and 0 <= cc < height:
if grid[rr][cc] != '.':
yield grid[rr][cc]
break
else:
break
for d in count(1):
rr, cc = r + d, c - d
if 0 <= rr < width and 0 <= cc < height:
if grid[rr][cc] != '.':
yield grid[rr][cc]
break
else:
break
grid = copy.deepcopy(orig_grid)
# for _ in range(5):
while 1:
prevgrid = copy.deepcopy(grid)
for r in range(len(grid)):
for c in range(len(grid[r])):
x = prevgrid[r][c]
if x == '.':
continue
neigh = ''.join(neighborswtf(prevgrid, r, c))
if x == 'L' and '#' not in neigh:
grid[r][c] = '#'
elif x == '#' and neigh.count('#') >= 5:
grid[r][c] = 'L'
# dump_char_matrix(grid)
# eprint('---')
if grid == prevgrid:
break
prevgrid = grid
ans = sum(l.count('#') for l in grid)
advent.print_answer(2, ans)