+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
0579d0a
master
1from itertools import count 2from operator import add 3from collections import defaultdict 4 5 6def size (elves ): 7return ( 8 (min (x for x ,_ in elves ),min (y for _ ,y in elves )), 9 (max (x for x ,_ in elves ),max (y for _ ,y in elves )), 10 ) 11 12 13def show (elves ): 14 (x0 ,y0 ), (x1 ,y1 )= size (elves ) 15for y in range (y0 ,y1 + 1 ): 16for x in range (x0 ,x1 + 1 ): 17"#" if (x ,y )in elves else "." ,end = "" ) 18elves = set () 23neighbors = tuple ((x ,y )for y in range (- 1 ,2 )for x in range (- 1 ,2 )if x or y ) 24dirs = ((0 ,- 1 ), (0 ,1 ), (- 1 ,0 ), (1 ,0 )) 25checks = (((- 1 ,0 ), (0 ,0 ), (1 ,0 )), ((0 ,- 1 ), (0 ,0 ), (0 ,1 ))) 26for y ,line in enumerate (open ("input" )): 27for x ,c in enumerate (line ): 28if c == "#" : 29elves .add ((x ,y )) 30# show(elves) 31 32dir = 0 33for i in count (1 ): 34moves = defaultdict (list ) 35moved = False 36for e in elves : 37if not any (tuple (map (add ,e ,n ))in elves for n in neighbors ): 38continue 39for j in range (4 ): 40pos = tuple (map (add ,e ,dirs [(dir + j )% 4 ])) 41if not any ( 42tuple (map (add ,pos ,c ))in elves for c in checks [(dir + j )% 4 // 2 ] 43 ): 44moves [pos ].append (e ) 45break 46for k ,v in moves .items (): 47if len (v )== 1 : 48moved = True 49elves .remove (v [0 ]) 50elves .add (k ) 51dir += 1 52if i == 10 : 53 (x0 ,y0 ), (x1 ,y1 )= size (elves ) 54y1 - y0 + 1 )* (x1 - x0 + 1 )- len (elves )) 55if not moved : 56i ) 57break