+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
3ce0ac6
master
1from functools import cache 2 3with open ("input" )as f : 4codes = f .read ().splitlines () 5pad = lambda s : { 6c : (x ,y )for y ,line in enumerate (s .splitlines ())for x ,c in enumerate (line ) 7} 8numpad = pad ("789\n456\n123\n.0A" ) 9dirpad = pad (".^A\n<v>" ) 10diff = lambda a ,b : (b [0 ]- a [0 ],b [1 ]- a [1 ]) 11strip_num = lambda s :int ("" .join ((c for c in s if c .isdigit ()))) 12 13 14@cache 15def shortest (s ,target ,level =- 1 ): 16if level == target : 17return len (s ) 18cur = numpad ["A" ]if level < 0 else dirpad ["A" ] 19total = 0 20for c in s : 21dx ,dy = diff (cur ,new := numpad [c ]if level < 0 else dirpad [c ]) 22hori = ("<" if dx < 0 else ">" )* abs (dx ) 23vert = ("^" if dy < 0 else "v" )* abs (dy ) 24recurse = lambda s :shortest (s + "A" ,target ,level + 1 ) 25a ,b = recurse (hori + vert ),recurse (vert + hori ) 26# fmt: off 27if (level < 0 and cur [0 ]== 0 and new [1 ]== 3 28or level >= 0 and cur [0 ]== 0 and new [1 ]== 0 ): 29total += a 30elif (level < 0 and cur [1 ]== 3 and new [0 ]== 0 31or level >= 0 and cur [1 ]== 0 and new [0 ]== 0 ): 32total += b 33# fmt: on 34else : 35total += min (a ,b ) 36cur = new 37return total 38 39 40solve = lambda n :sum ((shortest (code ,n )* strip_num (code )for code in codes )) 41solve (2 )) 42solve (25 ))