+/AoC

advent of code

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

Joseph RyanAttempt Day 205e96e12

master
1.1 KiB43 linesraw
1state = set()
2with open("test") as f:
3    key = [1 if c == "#" else 0 for c in f.readline()]
4    f.readline()
5    for y, l in enumerate(f):
6        for x, c in enumerate(l):
7            if c == "#":
8                state.add((x, y))
9
10symbols = (".", "#")
11nums = ("0", "1")
12neighbors = lambda x, y: [(x + a, y + b) for b in range(-1, 2) for a in range(-1, 2)]
13lookup = lambda x, y: key[int("".join(nums[n in state] for n in neighbors(x, y)), 2)]
14
15
16def bounding_box(points):
17    xs, ys = zip(*points)
18    return (min(xs), min(ys), max(xs), max(ys))
19
20
21def step(inv=False):
22    new = set()
23    l, t, r, b = bounding_box(state)
24    for y in range(t - 1, b + 2):
25        for x in range(l - 1, r + 2):
26            if inv != lookup(x, y):
27                new.add((x, y))
28    return new
29
30
31def display(inv=False):
32    l, t, r, b = bounding_box(state)
33    for y in range(t - 1, b + 2):
34        for x in range(l - 1, r + 2):
35            print(symbols[inv != ((x, y) in state)], end="")
36        print()
37
38
39# display()
40for i in range(2):
41    state = step(i % 2 == 0)
42    print(len(state))
43    # display(i % 2 == 0)