+/AoC

advent of code

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

Julia RyanDay 221d5fd88

master
945 B38 linesraw
1from operator import xor
2
3with open("input") as f:
4    numbers = [int(l) for l in f.readlines()]
5
6
7def evolve(n, steps=2000):
8    mix = xor
9    prune = lambda n: n % 16777216
10    res = [n]
11    for _ in range(steps):
12        n = prune(mix(n * 64, n))
13        n = prune(mix(n // 32, n))
14        n = prune(mix(n * 2048, n))
15        res.append(n)
16    return res
17
18
19buyers = [evolve(n) for n in numbers]
20print(sum(prices[-1] for prices in buyers))
21buyers = [[p % 10 for p in prices] for prices in buyers]
22diffs = [
23    [prices[i + 1] - prices[i] for i in range(len(prices) - 1)] for prices in buyers
24]
25best = []
26for b, d in zip(buyers, diffs):
27    seen = {}
28    for i in range(len(d) - 3):
29        seq, score = tuple(d[i : i + 4]), b[i + 4]
30        if seq not in seen:
31            seen[seq] = score
32    best.append(seen)
33
34seqs = {k for keys in best for k in keys}
35ans = 0
36for s in seqs:
37    ans = max(ans, sum(b.get(s) or 0 for b in best))
38print(ans)