+/AoC

advent of code

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

Joseph RyanDay 393e0b9d

master
947 B28 linesraw
1import re
2from itertools import product
3
4nums, num_grid = [], {}
5parts, gears = set(), set()
6for row, line in enumerate(open("input")):
7    for m in re.finditer(r"\d+", line):
8        col, size = m.start(), m.end() - m.start()
9        num_grid |= {(row, col + i): len(nums) for i in range(size)}
10        num_grid[pos := (row, m.start())] = len(nums)
11        nums.append(((row, col), int(line[m.start() : m.end()]), size))
12    for m in re.finditer(r"[^\d\s.]", line):
13        parts.add(pos := (row, m.start()))
14        if line[m.start()] == "*":
15            gears.add(pos)
16
17
18rect = lambda r, c, l: set(product(range(r - 1, r + 2), range(c - 1, c + l + 1)))
19print(sum(n for (row, col), n, l in nums if bool(rect(row, col, l) & parts)))
20
21s = 0
22for row, col in gears:
23    n = set(num_grid[(r, c)] for r, c in rect(row, col, 1) if (r, c) in num_grid)
24    print(n)
25    match list(n):
26        case [a, b]:
27            s += nums[a][1]*nums[b][1]
28print(s)