+/AoC

advent of code

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

Joseph RyanDays 7-14 (in python for now)a7718a0

master
1.1 KiB40 linesraw
1from dataclasses import dataclass
2from collections import deque
3from copy import deepcopy
4from math import lcm
5
6
7@dataclass
8class M:
9    items: deque[int]; op: str; test: int; yes: int; no: int; count: int=0  # fmt: skip
10
11
12def round(monkeys, max):
13    for m in monkeys:
14        for _ in range(len(m.items)):
15            old = m.items.popleft()
16            new = eval(m.op)
17            new = new % max if max else new // 3
18            monkeys[m.yes if not new % m.test else m.no].items.append(new)
19            m.count += 1
20
21
22def solve(monkeys, times, divide):
23    max = 0 if divide else lcm(*(m.test for m in monkeys))
24    for i in range(times):
25        round(monkeys, max)
26    counts = sorted((m.count for m in monkeys), reverse=True)
27    return counts[0] * counts[1]
28
29
30lines = [s.split(":")[-1].strip() for s in open("input").readlines()]
31monkeys = [
32    M(
33        deque(map(int, c[1].split(","))),
34        compile(c[2].split("= ")[-1], "", "eval"),
35        *(int(x.split()[-1]) for x in c[3:6]),
36    )
37    for c in [lines[i : i + 7] for i in range(0, len(lines), 7)]
38]
39print(solve(deepcopy(monkeys), 20, True))
40print(solve(deepcopy(monkeys), 10_000, False))