+/AoC

advent of code

git clone https://git.julia.blue/+/AoC

Joseph RyanDay 168e04c2f

master
1.3 KiB55 linesraw
1from itertools import product
2
3grid = [[int(c) for c in line.strip()] for line in open("input").readlines()]
4s = len(grid)
5
6
7def display(grid):
8    print()
9    for l in grid:
10        print("".join(map(str, l)).replace("0", "\x1b[1m0\x1b[0m"))
11
12
13def get_neighbors(x, y):
14    results = []
15    for i in range(-1, 2):
16        for j in range(-1, 2):
17            if i == 0 and j == 0:
18                continue
19            a, b = x + i, y + j
20            if not (0 <= a < s and 0 <= b < s):
21                continue
22            results.append((a, b))
23    return results
24
25
26points = list(product(range(s), range(s)))
27neighbors = {p: get_neighbors(p[0], p[1]) for p in points}
28flashes = 0
29# display(grid)
30
31for i in range(1, 1_000_000):
32    for x, y in points:
33        grid[x][y] += 1
34
35    prev = -1
36    flashed = [[False for _ in range(s)] for _ in range(s)]
37    while flashes != prev:
38        prev = flashes
39        for x, y in points:
40            if not flashed[x][y] and grid[x][y] > 9:
41                flashes += 1
42                flashed[x][y] = True
43                for a, b in get_neighbors(x, y):
44                    grid[a][b] += 1
45    for x, y in points:
46        if flashed[x][y]:
47            grid[x][y] = 0
48
49    if i == 100:
50        print(flashes)
51
52    if all((all(l) for l in flashed)):
53        print(i)
54        break
55    # display(grid)