advent-of-code/2022/python/day15.py

119 lines
2.4 KiB
Python
Raw Normal View History

2022-12-15 06:17:19 +00:00
import matrix
import math
from pprint import pprint
import shared
from scanf import scanf
from dataclasses import dataclass
2022-12-15 16:32:45 +00:00
#def fuckoff_ill_do_my_own_cityblock(y1,x1, y2,x2):
def cityblock(y1,x1, y2,x2):
return abs(y2-y1) + abs(x2-x1)
2022-12-15 06:17:19 +00:00
@dataclass
class Sensor:
sX: int
sY: int
bX: int
bY: int
@property
def s(self):
2022-12-15 16:32:45 +00:00
return (self.sY, self.sX)
2022-12-15 06:17:19 +00:00
@property
def b(self):
2022-12-15 16:32:45 +00:00
return (self.bY, self.bX)
2022-12-15 06:17:19 +00:00
@property
def distance(self):
2022-12-15 16:32:45 +00:00
return cityblock(self.sY,self.sX, self.bY, self.bX)
2022-12-15 06:17:19 +00:00
2022-12-15 16:32:45 +00:00
def distance_to(self, bY, bX):
return cityblock(self.sY,self.sX, bY, bX)
2022-12-15 06:17:19 +00:00
2022-12-15 15:08:01 +00:00
def on_line(self, y):
midpoint = (y,self.s[1])
d = self.distance_to(*midpoint)
if d > self.distance:
return []
2022-12-15 16:32:45 +00:00
need = self.distance - d
2022-12-15 15:08:01 +00:00
2022-12-15 16:32:45 +00:00
start = (y, midpoint[1] - need)
end = (y, midpoint[1] + need)
2022-12-15 15:08:01 +00:00
2022-12-15 16:32:45 +00:00
return list(range(start[1],end[1]+1))
2022-12-15 15:08:01 +00:00
2022-12-15 06:17:19 +00:00
#@shared.profile
def part1(rows):
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)
2022-12-15 16:32:45 +00:00
sensors.append(Sensor(sX=x,sY=y,bX=bx,bY=by))
2022-12-15 06:17:19 +00:00
minX, maxX = min(xSet),max(xSet)
minY, maxY = min(ySet),max(ySet)
2022-12-15 15:08:01 +00:00
2022-12-15 06:17:19 +00:00
for sensor in sensors:
beacon_points.append(sensor.b)
2022-12-15 16:32:45 +00:00
CHECK_ROW = 10
CHECK_ROW = 2000000
2022-12-15 15:08:01 +00:00
print(beacon_points)
print("")
2022-12-15 06:17:19 +00:00
ineligible = set()
2022-12-15 15:08:01 +00:00
for s in sensors:
coll = s.on_line(CHECK_ROW)
ineligible.update(coll)
#print(coll)
2022-12-15 16:32:45 +00:00
count_ignoring_current_beacons = 0
for i in ineligible:
if (CHECK_ROW, i) not in beacon_points:
count_ignoring_current_beacons += 1
2022-12-15 15:08:01 +00:00
2022-12-15 16:32:45 +00:00
#print(ineligible)
print(len(ineligible), "without removing beacons")
print(count_ignoring_current_beacons, "with removing beacons, final answer")
2022-12-15 06:17:19 +00:00
2022-12-15 15:08:01 +00:00
2022-12-15 06:17:19 +00:00
# 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()