+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
0579d0a
master
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" ): 8name = line [:4 ] 9if (rest := line [6 :- 1 ]).isnumeric (): 10tree [name ]= int (rest ) 11else : 12l ,r = rest [:4 ],rest [7 :11 ] 13parent [l ]= parent [r ]= name 14tree [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 ): 24if type (tree [n ])is int : 25return tree [n ] 26op ,l ,r = tree [n ] 27return operators [op ](solve (l ),solve (r )) 28 29 30solve ("root" )) 31 32 33def rev (cur ): 34child = cur 35cur = parent [child ] 36op ,l ,r = tree [cur ] 37if cur == "root" : 38# print(cur, l, "=", r, " : ", solve(r if l == child else l)) 39return solve (r if l == child else l ) 40par = rev (cur ) 41# print(cur, "=", l, op, r, end=" : ") 42if l == child : 43# print(par, op, solve(r)) 44return inv_ops [op ](par ,solve (r )) 45else : 46# print("-" if op == "-" else "" + str(par), op, solve(l)) 47return inv_ops [op ](((op != "-" )* 2 - 1 )* par ,solve (l )) 48 49 50rev ("humn" ))