From 1d208febef5106f24d724068b9c1d435b59ec1b7 Mon Sep 17 00:00:00 2001
From: Tyrel Souza <tyrel@tyrelsouza.com>
Date: Thu, 15 Dec 2022 01:17:19 -0500
Subject: [PATCH] day 15 part 1 - ATTEMPT

---
 2022/python/_sample.py |  23 +++++++---
 2022/python/day15.py   | 100 +++++++++++++++++++++++++++++++++++++++++
 2022/python/matrix.py  |  20 +++++----
 3 files changed, 128 insertions(+), 15 deletions(-)
 create mode 100644 2022/python/day15.py

diff --git a/2022/python/_sample.py b/2022/python/_sample.py
index f63bfff..2337a89 100644
--- a/2022/python/_sample.py
+++ b/2022/python/_sample.py
@@ -1,15 +1,26 @@
+import matrix
 import shared
-from pprint import pprint as pp
+import itertools
+import functools
+
+#@shared.profile
+def part1(rows):
+    pass
 
 
-def run(SOMETHING):
-    pp(SOMETHING)
 
+#@shared.profile
+def part2(rows):
+    pass
 
 def main():
-    spl = lambda y: [int(w) for w in y]
-    rows = [row.rstrip().split() for row in shared.load(3)]
-    print(run(rows))
+    rows = [row for row in shared.load_rows(15)]
+    with shared.elapsed_timer() as elapsed:
+        part1(rows)
+        print("🕒", elapsed())
+    with shared.elapsed_timer() as elapsed:
+        part2(rows)
+        print("🕒", elapsed())
 
 
 if __name__ == "__main__":
diff --git a/2022/python/day15.py b/2022/python/day15.py
new file mode 100644
index 0000000..538d9c5
--- /dev/null
+++ b/2022/python/day15.py
@@ -0,0 +1,100 @@
+import matrix
+import math
+from pprint import pprint
+import shared
+from scanf import scanf
+from dataclasses import dataclass
+from scipy.spatial.distance import cityblock
+
+def manhattan(a, b):
+    return abs(b[0] - a[0]) + abs(b[1] - a[1]) 
+
+@dataclass
+class Sensor:
+    sX: int
+    sY: int
+    bX: int
+    bY: int
+
+    @property
+    def s(self):
+        return (self.sY, self.sX)
+
+    @property
+    def b(self):
+        return (self.bY, self.bX)
+
+    @property
+    def distance(self):
+        a,b = zip(self.s, self.b)
+        return cityblock(a, b)
+
+    def distance_to(self, y,x):
+        a,b = zip(self.s, (y,x))
+        return cityblock(a, b)
+
+
+#@shared.profile
+def part1(rows):
+    CHECK_ROW = 10
+    CHECK_ROW = 2000000
+    sensors = []
+    sensor_points = []
+    beacon_points = []
+    xSet = set()
+    ySet = set()
+    for row in rows:
+        x,y,bx,by = scanf("Sensor at x=%d, y=%d: closest beacon is at x=%d, y=%d", row)
+        xSet.add(x)
+        xSet.add(bx)
+        ySet.add(y)
+        ySet.add(by)
+        sensors.append(Sensor(sX=x,sY=y,bX=bx,bY=by))
+    minX, maxX = min(xSet),max(xSet)
+    minY, maxY = min(ySet),max(ySet)
+    for sensor in sensors:
+        sensor_points.append(sensor.s)
+        beacon_points.append(sensor.b)
+
+    ineligible = set()
+    for x in range(minX,maxX):
+        point = (CHECK_ROW, x)
+        if x % 10000 == 0:
+            print(point)
+        if point in beacon_points:
+            continue
+        if point in sensor_points:
+            continue
+        for s in sensors:
+            d = s.distance_to(*point)
+            if d <= s.distance:
+                ineligible.add(point)
+    pprint(ineligible)
+    print(len(ineligible))
+
+    #    mx[sensor.sY][sensor.sX] = "S"
+    #    mx[sensor.bY][sensor.bX] = "B"
+    
+
+
+
+
+
+#@shared.profile
+def part2(rows):
+    pass
+
+def main():
+    rows = [row for row in shared.load_rows(15)]
+
+    with shared.elapsed_timer() as elapsed:
+        part1(rows)
+        print("🕒", elapsed())
+
+    with shared.elapsed_timer() as elapsed:
+        part2(rows)
+        print("🕒", elapsed())
+
+
+if __name__ == "__main__":
+    main()
diff --git a/2022/python/matrix.py b/2022/python/matrix.py
index ea0d8fc..9504fe9 100644
--- a/2022/python/matrix.py
+++ b/2022/python/matrix.py
@@ -154,7 +154,7 @@ def get_neighbor_coords(matrix, c, r, diagonals=True):
     return neighbors
 
 
-def line_of_sight_coords(matrix, row, col) -> Dict[str, List[Tuple[int, int]]]:
+def line_of_sight_coords(matrix, row, col, distance=None) -> Dict[str, List[Tuple[int, int]]]:
     """
     Takes a matrix, a row, and a column
     calculates the coordinates to the edge for all four cardinal directions
@@ -167,8 +167,12 @@ def line_of_sight_coords(matrix, row, col) -> Dict[str, List[Tuple[int, int]]]:
     col_ids = list(range(0, height))
     row_ids = list(range(0, width))
 
-    up_ids, down_ids = list(reversed(col_ids[:col])), col_ids[col + 1 :]
-    left_ids, right_ids = list(reversed(row_ids[:row])), row_ids[row + 1 :]
+    if distance:
+        up_ids, down_ids = list(reversed(col_ids[:col])), col_ids[col + 1 :col+distance+1]
+        left_ids, right_ids = list(reversed(row_ids[:row])), row_ids[row + 1 :row+distance+1]
+    else:
+        up_ids, down_ids = list(reversed(col_ids[:col])), col_ids[col + 1 :]
+        left_ids, right_ids = list(reversed(row_ids[:row])), row_ids[row + 1 :]
 
     left = [(r, col) for r in left_ids]
     right = [(r, col) for r in right_ids]
@@ -183,11 +187,11 @@ def line_of_sight_coords(matrix, row, col) -> Dict[str, List[Tuple[int, int]]]:
     }
 
 
-def line_of_sight(mx, row, col):
+def line_of_sight(mx, row, col, distance=None):
     """
     renders a line of sight coord calculation, into the values
     """
-    coords = line_of_sight_coords(mx, row, col)
+    coords = line_of_sight_coords(mx, row, col, distance)
     los = defaultdict(list)
     for k, ids in coords.items():
         for _row, _col in ids:
@@ -195,7 +199,6 @@ def line_of_sight(mx, row, col):
     return los
 
 
-
 def coords_between_points(point1, point2):
     y1,x1 = point1
     y2,x2 = point2
@@ -222,9 +225,6 @@ def coords_between_points(point1, point2):
             coords.append((_y,x))
     return coords
     
-    
-
-    
 
 
 
@@ -337,3 +337,5 @@ def highlight(matrix, red=[], green=[], blue=[], blink_green=[]):
         new = f"{colors.BLINK}{colors.GREEN}{mx[y][x]}{colors.ENDC}"
         mx[y][x] = new
     ppmx(mx, pad=False, space=True, zero="0")
+
+