/
day11.py
71 lines (57 loc) · 2.01 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
from copy import deepcopy
# Import file
with open("day11-input.txt", "r") as f:
data = f.readlines()
# Format data
data = [[int(y) for y in x.strip()] for x in data]
neighbours = [(-1, -1), (0, -1), (1, -1), (-1, 0), (1, 0), (-1, 1), (0, 1), (1, 1)]
def gridHasCharged(grid) -> bool:
flat = [item for row in grid for item in row if item > 9]
return len(flat) > 0
def step(grid: list[list[int]]) -> tuple[list[list[int]], int]:
grid = deepcopy(grid)
flashCount = 0
# Increase all by 1
for y in range(len(grid)):
for x in range(len(grid[0])):
grid[y][x] += 1
# Simulate flashes
while gridHasCharged(grid):
for y in range(len(grid)):
for x in range(len(grid[0])):
if grid[y][x] > 9:
grid[y][x] = -9999
flashCount += 1
for (dx, dy) in neighbours:
try:
if y + dy >= 0 and x + dx >= 0:
grid[y + dy][x + dx] += 1
except IndexError:
pass # ...
# Set flashes to zero
for y in range(len(grid)):
for x in range(len(grid[0])):
if grid[y][x] < 0:
grid[y][x] = 0
return grid, flashCount
def day11a(grid: list[list[int]]) -> int:
doSteps = 100
flashCount = 0
for i in range(doSteps):
grid, newFlashes = step(grid)
flashCount += newFlashes
return flashCount
def isAllZero(grid: list[list[int]]) -> bool:
flat = [item for row in grid for item in row if item != 0]
return len(flat) == 0
def day11b(grid: list[list[int]]) -> int:
stepCount = 0
while not isAllZero(grid):
grid, _ = step(grid)
stepCount += 1
return stepCount
if __name__ == "__main__":
# How many total flashes are there after 100 steps?
print(f"Day11a: {day11a(data)}") # 1665
# What is the first step during which all octopuses flash?
print(f"Day11b: {day11b(data)}") # 235