+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
93e0b9d
master
1import re 2from itertools import product 3 4nums ,num_grid = [], {} 5parts ,gears = set (),set () 6for row ,line in enumerate (open ("input" )): 7for m in re .finditer (r"\d+" ,line ): 8col ,size = m .start (),m .end ()- m .start () 9num_grid |= {(row ,col + i ):len (nums )for i in range (size )} 10num_grid [pos := (row ,m .start ())]= len (nums ) 11nums .append (((row ,col ),int (line [m .start () :m .end ()]),size )) 12for m in re .finditer (r"[^\d\s.]" ,line ): 13parts .add (pos := (row ,m .start ())) 14if line [m .start ()]== "*" : 15gears .add (pos ) 16 17 18rect = lambda r ,c ,l :set (product (range (r - 1 ,r + 2 ),range (c - 1 ,c + l + 1 ))) 19sum (n for (row ,col ),n ,l in nums if bool (rect (row ,col ,l )& parts ))) 20 21s = 0 22for row ,col in gears : 23n = set (num_grid [(r ,c )]for r ,c in rect (row ,col ,1 )if (r ,c )in num_grid ) 24n ) 25match list (n ): 26case [a ,b ]: 27s += nums [a ][1 ]* nums [b ][1 ] 28s )