adventofcode-2021/day24.py at master · michaelerne/adventofcode-2021 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
from run_util import run_puzzle


def get_pairs(data):
    lines = data.split('\n')
    pairs = [(int(lines[i * 18 + 5][6:]), int(lines[i * 18 + 15][6:])) for i in range(14)]
    return pairs


def get_links(pairs):
    stack = []
    links = {}

    for i, (x_add, y_add) in enumerate(pairs):
        if x_add > 0:
            stack.append((i, y_add))
        else:
            j, y_add_2 = stack.pop()
            links[i] = (j, y_add_2 + x_add)

    return links


def part_a(data):
    pairs = get_pairs(data)
    links = get_links(pairs)

    assignments = {}

    for i, (j, delta) in links.items():
        assignments[i] = min(9, 9 + delta)
        assignments[j] = min(9, 9 - delta)

    answer = int("".join(str(assignments[x]) for x in range(14)))

    return answer


def part_b(data):
    pairs = get_pairs(data)
    links = get_links(pairs)

    assignments = {}

    for i, (j, delta) in links.items():
        assignments[i] = max(1, 1 + delta)
        assignments[j] = max(1, 1 - delta)

    answer = int("".join(str(assignments[x]) for x in range(14)))

    return answer


def main():
    examples = []
    day = int(__file__.split('/')[-1].split('.')[0][-2:])
    run_puzzle(day, part_a, part_b, examples)


if __name__ == '__main__':
    main()