advent-of-code-2021/src/day10.py at master · markusremplbauer/advent-of-code-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
62
63
64
65
66
67
68
69
70
71
72
73
74
# Advent of Code 2021, Day 10
# markusremplbauer

from aocd.models import Puzzle
from funcy import print_calls

opening = ["(", "[", "{", "<"]
closing = [")", "]", "}", ">"]
mappings = {
    ")": {"opening": "(", "illegal": 3, "incomplete": 1},
    "]": {"opening": "[", "illegal": 57, "incomplete": 2},
    "}": {"opening": "{", "illegal": 1197, "incomplete": 3},
    ">": {"opening": "<", "illegal": 25137, "incomplete": 4},
}


@print_calls
def part1(data):
    err = 0
    for line in data:
        e_res, _ = parse_line(line)
        err += e_res

    return err


@print_calls
def part2(data):
    scores = []
    for line in data:
        _, comp = parse_line(line)

        if comp is not None:
            score = 0
            for e in comp:
                score *= 5
                score += mappings[e]["incomplete"]

            scores.append(score)

    return sorted(scores)[len(scores) // 2]


def parse_line(line):
    values = []
    for e in line:
        if e in opening:
            values.append(e)
        elif e in closing and mappings[e]["opening"] == values[-1]:
            values.pop()
        else:
            return mappings[e]["illegal"], None

    comp = "".join(
        reversed([k for e in values for k, v in mappings.items() if v["opening"] == e])
    )
    return 0, comp


def load(data):
    return data.splitlines()


def main():
    puzzle = Puzzle(year=2021, day=10)

    ans1 = part1(load(puzzle.input_data))
    # puzzle.answer_a = ans1
    ans2 = part2(load(puzzle.input_data))
    # puzzle.answer_b = ans2


if __name__ == "__main__":
    main()