+/AoC

advent of code

git clone https://git.julia.blue/+/AoC

Joseph RyanStart 2023!c203ef0

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