+/AoC

advent of code

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

Joseph RyanA lot closer this year! (missing 19 and 22b)0579d0a

master
1.2 KiB50 linesraw
1import operator as op
2
3tree = {}
4operators = {"+": op.add, "-": op.sub, "*": op.mul, "/": op.floordiv}
5inv_ops = {"+": op.sub, "-": op.add, "*": op.floordiv, "/": op.mul}
6parent = {}
7for line in open("input"):
8    name = line[:4]
9    if (rest := line[6:-1]).isnumeric():
10        tree[name] = int(rest)
11    else:
12        l, r = rest[:4], rest[7:11]
13        parent[l] = parent[r] = name
14        tree[name] = (rest[5], l, r)
15
16# # dot
17# print("digraph G {")
18# for k, v in waiting.items():
19#     print(k, "->", f"{{{', '.join(v[1:])}}}")
20# print("}")
21
22
23def solve(n):
24    if type(tree[n]) is int:
25        return tree[n]
26    op, l, r = tree[n]
27    return operators[op](solve(l), solve(r))
28
29
30print(solve("root"))
31
32
33def rev(cur):
34    child = cur
35    cur = parent[child]
36    op, l, r = tree[cur]
37    if cur == "root":
38        # print(cur, l, "=", r, "  :  ", solve(r if l == child else l))
39        return solve(r if l == child else l)
40    par = rev(cur)
41    # print(cur, "=", l, op, r, end="  :  ")
42    if l == child:
43        # print(par, op, solve(r))
44        return inv_ops[op](par, solve(r))
45    else:
46        # print("-" if op == "-" else "" + str(par), op, solve(l))
47        return inv_ops[op](((op != "-") * 2 - 1) * par, solve(l))
48
49
50print(rev("humn"))