2019 day 19 part 2

2019/aoc2019/day19.py

@@ -0,0 +1,66 @@
+import copy
+import itertools
+from collections import deque
+from typing import TextIO, Tuple
+
+from aoc2019.intcode import Computer, read_program
+
+
+def query_position(x: int, y: int, computer: Computer) -> bool:
+    computer = copy.deepcopy(computer)
+
+    computer.send_input(x)
+    computer.send_input(y)
+    computer.run()
+
+    return computer.get_output() == 1
+
+
+def find_line(y: int, x_min: int, x_max: int, computer: Computer) -> Tuple[int, int]:
+    # First find start of the line:
+    offset = 0
+
+    while not query_position(x_min, y, computer):
+        offset += 1
+        x_min += 1
+
+    x_max += offset
+    while query_position(x_max, y, computer):
+        x_max += 1
+
+    x_max -= 1
+
+    return x_min, x_max
+
+
+def part1(data: TextIO) -> int:
+    computer = Computer(read_program(data))
+
+    x_min, x_max = (0, 0)
+    total = 0
+
+    for y in range(50):
+        x_min, x_max = find_line(y, x_min, x_max, computer)
+        total += min(x_max, 49) - min(x_min, 50) + 1
+
+    return total
+
+
+def part2(data: TextIO) -> int:
+    computer = Computer(read_program(data))
+
+    x_min, x_max = (0, 0)
+
+    lines = deque()
+
+    for y in itertools.count():
+        x_min, x_max = find_line(y, x_min, x_max, computer)
+        lines.append((x_min, x_max))
+
+        if len(lines) == 100:
+            x_top_min, x_top_max = lines.popleft()
+
+            if x_top_max - x_min + 1 < 100:
+                continue
+
+            return x_min * 10000 + y - 99