+/AoC

advent of code

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

Joseph RyanLinked lists really are more performant sometimes50b5615

master
1.3 KiB53 linesraw
1class Node:
2    def __init__(self, value):
3        self.data = value
4        self.prev = None
5        self.next = None
6
7
8def show(current):
9    while current.data != 0:
10        current = current.next
11    temp = [current.data]
12    current = current.next
13    while current.data != 0:
14        temp.append(current.data)
15        current = current.next
16    print(temp)
17
18
19def simulate(players, last):
20    scores = [0] * players
21    current = Node(0)
22    current.next = current
23    current.prev = current
24    player = 0
25    for i in range(1, last + 1):
26        if i % 23 == 0:
27            for _ in range(7):
28                current = current.prev
29            scores[player] += i + current.data
30            prev = current.prev
31            current = current.next
32            prev.next = current
33            current.prev = prev
34        else:
35            current = current.next
36            temp = current.next
37            current.next = Node(i)
38            current.next.prev = current
39            current = current.next
40            current.next = temp
41            temp.prev = current
42        player = (player + 1) % len(scores)
43    return max(scores)
44
45
46with open("input.txt") as f:
47    stuff = f.read().strip().split()
48
49players = int(stuff[0])
50last = int(stuff[6])
51
52print("max score:", simulate(players, last))
53print("max score (x100):", simulate(players, last * 100))