+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
c203ef0
master
1import re 2from dataclasses import dataclass 3from collections import defaultdict 4 5@dataclass( order = True , unsafe_hash = True ) 6class Point : 7x :int 8y :int 9def __repr__ (self ): 10return f"( { self . x } , { self . y } )" 11 12lines = [] 13with open ("input" )as f : 14for l in f : 15x1 ,y1 ,x2 ,y2 = map (int ,re .findall (r"\d+" ,l )) 16a ,b = sorted ((Point (x1 ,y1 ),Point (x2 ,y2 ))) 17lines .append ((a ,b )) 18 19def get_overlaps (lines ): 20overlaps = defaultdict (int ) 21for l in lines : 22if l [0 ].x == l [1 ].x : 23for y in range (l [0 ].y ,l [1 ].y + 1 ): 24overlaps [Point (l [0 ].x ,y )]+= 1 25elif l [0 ].y == l [1 ].y : 26for x in range (l [0 ].x ,l [1 ].x + 1 ): 27overlaps [Point (x ,l [0 ].y )]+= 1 28else : 29y0 ,y1 = l [0 ].y ,l [1 ].y 30ry = range (y0 ,y1 + 1 ) 31if y1 < y0 : 32ry = range (y0 ,y1 - 1 ,- 1 ) 33for x ,y in zip (range (l [0 ].x ,l [1 ].x + 1 ),ry ): 34overlaps [Point (x ,y )]+= 1 35return overlaps 36 37def diagram (lines ): 38overlaps = get_overlaps (lines ) 39for y in range (10 ): 41line = [overlaps [Point (x ,y )]for x in range (10 )] 42"" .join (str (n )if n > 0 else "." for n in line )) 43straight = list (filter (lambda l :l [0 ].x == l [1 ].x or l [0 ].y == l [1 ].y ,lines )) 47 48len (list (filter (lambda v :v > 1 ,get_overlaps (straight ).values ())))) 49# diagram(straight) 50 51diag = list (filter (lambda l :abs (l [0 ].y - l [1 ].y )== abs (l [0 ].x - l [1 ].x ),lines )) 52 53len (list (filter (lambda v :v > 1 ,get_overlaps (straight + diag ).values ())))) 54# diagram(straight + diag)