Backup local 2022 day 16.

.drone.yml

@@ -1,12 +0,0 @@
----
-kind: pipeline
-type: docker
-name: default
-
-steps:
-  - name: tests
-    image: python:3.10-slim
-    commands:
-      - pip install poetry
-      - poetry install
-      - poetry run poe lint

.gitignore

@@ -1,6 +1 @@
-# python / VS Code
 venv
-__pycache__
-.ruff_cache
-.vscode
-build

2021/day5.py

@@ -1,4 +1,7 @@
+# -*- encoding: utf-8 -*-
+
 import sys
+from collections import defaultdict
 
 import numpy as np
 
@@ -31,6 +34,7 @@ counts_1 = np.zeros((y_max + 1, x_max + 1), dtype=int)
 counts_2 = counts_1.copy()
 
 for (x1, y1), (x2, y2) in sections:
+
     x_rng = range(x1, x2 + 1, 1) if x2 >= x1 else range(x1, x2 - 1, -1)
     y_rng = range(y1, y2 + 1, 1) if y2 >= y1 else range(y1, y2 - 1, -1)
 

2022/day1.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 blocks = sys.stdin.read().split("\n\n")

2022/day10.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 lines = sys.stdin.read().splitlines()

2022/day11.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import copy
 import sys
 from functools import reduce
@@ -5,6 +7,7 @@ from typing import Callable, Final, Mapping, Sequence
 
 
 class Monkey:
+
     id: Final[int]
     items: Final[Sequence[int]]
     worry_fn: Final[Callable[[int], int]]
@@ -94,7 +97,8 @@ def run(
     # number of inspects
     inspects = {monkey: 0 for monkey in monkeys}
 
-    for _ in range(n_rounds):
+    for round in range(n_rounds):
+
         for monkey in monkeys:
             for item in items[monkey]:
                 inspects[monkey] += 1

2022/day12.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import heapq
 import sys
 from typing import Callable, Iterator, TypeVar
@@ -42,6 +44,7 @@ def dijkstra(
         visited.add(current)
 
         for neighbor in neighbors(current):
+
             if neighbor in visited:
                 continue
 
@@ -57,6 +60,7 @@ def dijkstra(
 
 
 def make_path(parents: dict[Node, Node], start: Node, end: Node) -> list[Node] | None:
+
     if end not in parents:
         return None
 
@@ -105,6 +109,7 @@ def neighbors(
         (c_row, c_col - 1),
         (c_row, c_col + 1),
     ):
+
         if not (n_row >= 0 and n_row < n_rows and n_col >= 0 and n_col < n_cols):
             continue
 
@@ -122,8 +127,8 @@ lines = sys.stdin.read().splitlines()
 
 grid = [[ord(cell) - ord("a") for cell in line] for line in lines]
 
-start: tuple[int, int] | None = None
-end: tuple[int, int] | None = None
+start: tuple[int, int]
+end: tuple[int, int]
 
 # for part 2
 start_s: list[tuple[int, int]] = []
@@ -138,9 +143,6 @@ for i_row, row in enumerate(grid):
         elif col == 0:
             start_s.append((i_row, i_col))
 
-assert start is not None
-assert end is not None
-
 # fix values
 grid[start[0]][start[1]] = 0
 grid[end[0]][end[1]] = ord("z") - ord("a")

2022/day13.py

@@ -1,27 +1,27 @@
+# -*- encoding: utf-8 -*-
+
 import json
 import sys
 from functools import cmp_to_key
-from typing import TypeAlias, cast
 
 blocks = sys.stdin.read().strip().split("\n\n")
 
 pairs = [tuple(json.loads(p) for p in block.split("\n")) for block in blocks]
 
-Packet: TypeAlias = list[int | list["Packet"]]
 
+def compare(lhs: list[int | list], rhs: list[int | list]) -> int:
 
-def compare(lhs: Packet, rhs: Packet) -> int:
     for lhs_a, rhs_a in zip(lhs, rhs):
         if isinstance(lhs_a, int) and isinstance(rhs_a, int):
             if lhs_a != rhs_a:
                 return rhs_a - lhs_a
         else:
             if not isinstance(lhs_a, list):
-                lhs_a = [lhs_a]  # type: ignore
+                lhs_a = [lhs_a]
             elif not isinstance(rhs_a, list):
-                rhs_a = [rhs_a]  # type: ignore
+                rhs_a = [rhs_a]
             assert isinstance(rhs_a, list) and isinstance(lhs_a, list)
-            r = compare(cast(Packet, lhs_a), cast(Packet, rhs_a))
+            r = compare(lhs_a, rhs_a)
             if r != 0:
                 return r
 

2022/day14.py

@@ -1,4 +1,7 @@
+# -*- encoding: utf-8 -*-
+
 import sys
+from collections import defaultdict
 from enum import Enum, auto
 from typing import Callable, cast
 
@@ -20,10 +23,10 @@ def print_blocks(blocks: dict[tuple[int, int], Cell]):
         blocks: Set of blocks to print.
     """
     x_min, y_min, x_max, y_max = (
-        min(x for x, _ in blocks),
+        min(x for x, y in blocks),
         0,
-        max(x for x, _ in blocks),
-        max(y for _, y in blocks),
+        max(x for x, y in blocks),
+        max(y for x, y in blocks),
     )
 
     for y in range(y_min, y_max + 1):
@@ -53,12 +56,13 @@ def flow(
         The input blocks.
     """
 
-    y_max = max(y for _, y in blocks)
+    y_max = max(y for x, y in blocks)
 
     while True:
         x, y = 500, 0
 
         while y <= y_max:
+
             moved = False
             for cx, cy in ((x, y + 1), (x - 1, y + 1), (x + 1, y + 1)):
                 if (cx, cy) not in blocks and fill_fn(cx, cy) == Cell.AIR:
@@ -113,10 +117,10 @@ print_blocks(blocks)
 print()
 
 x_min, y_min, x_max, y_max = (
-    min(x for x, _ in blocks),
+    min(x for x, y in blocks),
     0,
-    max(x for x, _ in blocks),
-    max(y for _, y in blocks),
+    max(x for x, y in blocks),
+    max(y for x, y in blocks),
 )
 
 # === part 1 ===

2022/day15.py

@@ -0,0 +1,90 @@
+# -*- encoding: utf-8 -*-
+
+import sys
+
+import numpy as np
+import parse
+
+
+def part1(sensor_to_beacon: dict[tuple[int, int], tuple[int, int]], row: int) -> int:
+
+    no_beacons_row_l: list[np.ndarray] = []
+
+    for (sx, sy), (bx, by) in sensor_to_beacon.items():
+        d = abs(sx - bx) + abs(sy - by)  # closest
+
+        no_beacons_row_l.append(sx - np.arange(0, d - abs(sy - row) + 1))
+        no_beacons_row_l.append(sx + np.arange(0, d - abs(sy - row) + 1))
+
+    beacons_at_row = set(bx for (bx, by) in sensor_to_beacon.values() if by == row)
+    no_beacons_row = set(np.concatenate(no_beacons_row_l)).difference(beacons_at_row)
+
+    return len(no_beacons_row)
+
+
+def part2_intervals(
+    sensor_to_beacon: dict[tuple[int, int], tuple[int, int]], xy_max: int
+) -> tuple[int, int, int]:
+    from tqdm import trange
+
+    for y in trange(xy_max + 1):
+        its: list[tuple[int, int]] = []
+        for (sx, sy), (bx, by) in sensor_to_beacon.items():
+            d = abs(sx - bx) + abs(sy - by)
+            dx = d - abs(sy - y)
+
+            if dx >= 0:
+                its.append((max(0, sx - dx), min(sx + dx, xy_max)))
+
+        its = sorted(its)
+        s, e = its[0]
+
+        for si, ei in its[1:]:
+            if si > e + 1:
+                return si - 1, y, 4_000_000 * (si - 1) + y
+            if ei > e:
+                e = ei
+
+    return (0, 0, 0)
+
+
+def part2_cplex(
+    sensor_to_beacon: dict[tuple[int, int], tuple[int, int]], xy_max: int
+) -> tuple[int, int, int]:
+    from docplex.mp.model import Model
+
+    m = Model()
+
+    x, y = m.continuous_var_list(2, ub=xy_max, name=["x", "y"])
+
+    for (sx, sy), (bx, by) in sensor_to_beacon.items():
+        d = abs(sx - bx) + abs(sy - by)
+        m.add_constraint(m.abs(x - sx) + m.abs(y - sy) >= d + 1, ctname=f"ct_{sx}_{sy}")
+
+    m.set_objective("min", x + y)
+
+    s = m.solve()
+
+    vx = int(s.get_value(x))
+    vy = int(s.get_value(y))
+    return vx, vy, 4_000_000 * vx + vy
+
+
+lines = sys.stdin.read().splitlines()
+
+sensor_to_beacon: dict[tuple[int, int], tuple[int, int]] = {}
+
+for line in lines:
+    r = parse.parse(
+        "Sensor at x={sx}, y={sy}: closest beacon is at x={bx}, y={by}", line
+    )
+    sensor_to_beacon[int(r["sx"]), int(r["sy"])] = (int(r["bx"]), int(r["by"]))
+
+xy_max = 4_000_000 if max(sensor_to_beacon) > (1_000, 0) else 20
+row = 2_000_000 if max(sensor_to_beacon) > (1_000, 0) else 10
+
+print(f"answer 1 is {part1(sensor_to_beacon, row)}")
+
+# x, y, a2 = part2_cplex(sensor_to_beacon, xy_max)
+x, y, a2 = part2_intervals(sensor_to_beacon, xy_max)
+print(f"answer 2 is {a2} (x={x}, y={y})")

2022/day16.py

@@ -0,0 +1,270 @@
+# -*- encoding: utf-8 -*-
+
+from __future__ import annotations
+
+import heapq
+import itertools
+import re
+import sys
+import time as time_p
+from collections import defaultdict
+from typing import FrozenSet, NamedTuple
+
+from tqdm import tqdm, trange
+
+
+class Pipe(NamedTuple):
+    name: str
+    flow: int
+    tunnels: list[str]
+
+    def __lt__(self, other: object) -> bool:
+        return isinstance(other, Pipe) and other.name < self.name
+
+    def __eq__(self, other: object) -> bool:
+        return isinstance(other, Pipe) and other.name == self.name
+
+    def __hash__(self) -> int:
+        return hash(self.name)
+
+    def __str__(self) -> str:
+        return self.name
+
+    def __repr__(self) -> str:
+        return self.name
+
+
+def breadth_first_search(pipes: dict[str, Pipe], pipe: Pipe) -> dict[Pipe, int]:
+    """
+    Runs a BFS from the given pipe and return the shortest distance (in term of hops)
+    to all other pipes.
+    """
+    queue = [(0, pipe_1)]
+    visited = set()
+    distances: dict[Pipe, int] = {}
+
+    while len(distances) < len(pipes):
+        distance, current = heapq.heappop(queue)
+
+        if current in visited:
+            continue
+
+        visited.add(current)
+        distances[current] = distance
+
+        for tunnel in current.tunnels:
+            heapq.heappush(queue, (distance + 1, pipes[tunnel]))
+
+    return distances
+
+
+def update_with_better(
+    node_at_times: dict[FrozenSet[Pipe], int], flow: int, flowing: FrozenSet[Pipe]
+) -> None:
+    node_at_times[flowing] = max(node_at_times[flowing], flow)
+
+
+def part_1(
+    start_pipe: Pipe,
+    max_time: int,
+    distances: dict[tuple[Pipe, Pipe], int],
+    relevant_pipes: FrozenSet[Pipe],
+):
+
+    node_at_times: dict[int, dict[Pipe, dict[FrozenSet[Pipe], int]]] = defaultdict(
+        lambda: defaultdict(lambda: defaultdict(lambda: 0))
+    )
+    node_at_times[0] = {start_pipe: {frozenset(): 0}}
+
+    for time in range(max_time):
+        for c_pipe, nodes in node_at_times[time].items():
+            for flowing, flow in nodes.items():
+                for target in relevant_pipes:
+
+                    distance = distances[c_pipe, target] + 1
+                    if time + distance >= max_time or target in flowing:
+                        continue
+
+                    update_with_better(
+                        node_at_times[time + distance][target],
+                        flow + sum(pipe.flow for pipe in flowing) * distance,
+                        flowing | {target},
+                    )
+
+                update_with_better(
+                    node_at_times[max_time][c_pipe],
+                    flow + sum(pipe.flow for pipe in flowing) * (max_time - time),
+                    flowing,
+                )
+
+    return max(
+        flow
+        for nodes_of_pipe in node_at_times[max_time].values()
+        for flow in nodes_of_pipe.values()
+    )
+
+
+def part_2(
+    start_pipe: Pipe,
+    max_time: int,
+    pipes: dict[str, Pipe],
+    relevant_pipes: FrozenSet[Pipe],
+    distances: dict[tuple[Pipe, Pipe], int],
+):
+
+    node_at_times: dict[
+        int, dict[tuple[Pipe, Pipe], dict[FrozenSet[Pipe], int]]
+    ] = defaultdict(lambda: defaultdict(lambda: defaultdict(lambda: 0)))
+    node_at_times[0] = {(start_pipe, start_pipe): {frozenset(): 0}}
+
+    # map node + distance to
+    d1, d2, d3, d4 = 0, 0, 0, 0
+    best_flow = 0
+
+    for time in range(max_time):
+        print(
+            f"{time + 1:2d}/{max_time} - {best_flow:4d} - "
+            f"{sum(map(len, node_at_times[time].values())):7d} - "
+            f"{d1:.3f} {d2:.3f} {d3:.3f} {d4:.3f}"
+        )
+
+        d1, d2, d3, d4 = 0, 0, 0, 0
+        for (c_pipe, e_pipe), nodes in node_at_times[time].items():
+            for flowing, flow in nodes.items():
+
+                t1 = time_p.time()
+
+                c_best_flow = (
+                    flow
+                    + sum(pipe.flow for pipe in flowing) * (max_time - time)
+                    + sum(
+                        (
+                            pipe.flow
+                            * (
+                                max_time
+                                - time
+                                - 1
+                                - min(distances[c_pipe, pipe], distances[e_pipe, pipe])
+                            )
+                            for pipe in relevant_pipes
+                            if pipe not in flowing
+                        ),
+                        start=0,
+                    )
+                )
+
+                d1 += time_p.time() - t1
+
+                if c_best_flow < best_flow:
+                    continue
+
+                best_flow = max(
+                    best_flow,
+                    flow + sum(pipe.flow for pipe in flowing) * (max_time - time),
+                )
+
+                t1 = time_p.time()
+
+                if flowing != relevant_pipes:
+                    for c_next_s, e_next_s in itertools.product(
+                        c_pipe.tunnels, e_pipe.tunnels
+                    ):
+
+                        c_next = pipes[c_next_s]
+                        e_next = pipes[e_next_s]
+                        update_with_better(
+                            node_at_times[time + 1][c_next, e_next],
+                            flow + sum(pipe.flow for pipe in flowing),
+                            flowing,
+                        )
+
+                d2 += time_p.time() - t1
+
+                t1 = time_p.time()
+
+                if c_pipe in relevant_pipes and c_pipe not in flowing:
+                    for e_next_s in e_pipe.tunnels:
+
+                        e_next = pipes[e_next_s]
+
+                        update_with_better(
+                            node_at_times[time + 1][c_pipe, e_next],
+                            flow + sum(pipe.flow for pipe in flowing),
+                            flowing | {c_pipe},
+                        )
+
+                if e_pipe in relevant_pipes and e_pipe not in flowing:
+                    for c_next_s in c_pipe.tunnels:
+
+                        c_next = pipes[c_next_s]
+
+                        update_with_better(
+                            node_at_times[time + 1][c_next, e_pipe],
+                            flow + sum(pipe.flow for pipe in flowing),
+                            flowing | {e_pipe},
+                        )
+
+                if (
+                    e_pipe in relevant_pipes
+                    and c_pipe in relevant_pipes
+                    and e_pipe not in flowing
+                    and c_pipe not in flowing
+                ):
+                    update_with_better(
+                        node_at_times[time + 1][c_pipe, e_pipe],
+                        flow + sum(pipe.flow for pipe in flowing),
+                        flowing | {c_pipe, e_pipe},
+                    )
+
+                update_with_better(
+                    node_at_times[max_time][c_pipe, e_pipe],
+                    flow + sum(pipe.flow for pipe in flowing) * (max_time - time),
+                    flowing,
+                )
+
+                d3 += time_p.time() - t1
+
+    return max(
+        flow
+        for nodes_of_pipe in node_at_times[max_time].values()
+        for flow in nodes_of_pipe.values()
+    )
+
+
+# === MAIN ===
+
+
+lines = sys.stdin.read().splitlines()
+
+
+pipes: dict[str, Pipe] = {}
+for line in lines:
+    r = re.match(
+        R"Valve ([A-Z]+) has flow rate=([0-9]+); tunnels? leads? to valves? (.+)",
+        line,
+    )
+    assert r
+
+    g = r.groups()
+
+    pipes[g[0]] = Pipe(g[0], int(g[1]), g[2].split(", "))
+
+# compute distances from one valve to any other
+distances: dict[tuple[Pipe, Pipe], int] = {}
+for pipe_1 in pipes.values():
+    distances.update(
+        {
+            (pipe_1, pipe_2): distance
+            for pipe_2, distance in breadth_first_search(pipes, pipe_1).items()
+        }
+    )
+
+# valves with flow
+relevant_pipes = frozenset(pipe for pipe in pipes.values() if pipe.flow > 0)
+
+
+# 1651, 1653
+print(part_1(pipes["AA"], 30, distances, relevant_pipes))
+
+# 1707, 2223
+print(part_2(pipes["AA"], 26, pipes, relevant_pipes, distances))

2022/day17.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 from typing import Sequence, TypeVar
 
@@ -47,6 +49,7 @@ def build_tower(
     early_stop: bool = False,
     init: np.ndarray = np.ones(WIDTH, dtype=bool),
 ) -> tuple[np.ndarray, int, int, dict[int, int]]:
+
     tower = EMPTY_BLOCKS.copy()
     tower[0, :] = init
 
@@ -56,6 +59,7 @@ def build_tower(
     rock_count = 0
 
     for rock_count in range(n_rocks):
+
         if early_stop:
             if i_rock == 0 and (i_rock, i_jet) in done_at:
                 break
@@ -71,6 +75,7 @@ def build_tower(
             tower = np.concatenate([tower, EMPTY_BLOCKS], axis=0)
 
         while True:
+
             jet, i_jet = next_cycle(jets, i_jet)
 
             dx = 0

2022/day18.py

@@ -1,4 +1,7 @@
+# -*- encoding: utf-8 -*-
+
 import sys
+from typing import FrozenSet
 
 import numpy as np
 

2022/day19.py

@@ -1,9 +1,11 @@
+# -*- encoding: utf-8 -*-
+
 import sys
-from typing import Any, Literal
+from typing import Literal
 
 import numpy as np
-import parse  # pyright: ignore[reportMissingTypeStubs]
-from numpy.typing import NDArray
+import parse
+from tqdm import tqdm
 
 Reagent = Literal["ore", "clay", "obsidian", "geode"]
 REAGENTS: tuple[Reagent, ...] = (
@@ -35,7 +37,7 @@ class State:
             self.robots = robots
             self.reagents = reagents
 
-    def __eq__(self, other: object) -> bool:
+    def __eq__(self, other) -> bool:
         return (
             isinstance(other, State)
             and self.robots == other.robots
@@ -66,7 +68,7 @@ lines = sys.stdin.read().splitlines()
 
 blueprints: list[dict[Reagent, IntOfReagent]] = []
 for line in lines:
-    r: list[int] = parse.parse(  # type: ignore
+    r = parse.parse(
         "Blueprint {}: "
         "Each ore robot costs {:d} ore. "
         "Each clay robot costs {:d} ore. "
@@ -86,6 +88,7 @@ for line in lines:
 
 
 def run(blueprint: dict[Reagent, dict[Reagent, int]], max_time: int) -> int:
+
     # since we can only build one robot per time, we do not need more than X robots
     # of type K where X is the maximum number of K required among all robots, e.g.,
     # in the first toy blueprint, we need at most 4 ore robots, 14 clay ones and 7
@@ -94,12 +97,12 @@ def run(blueprint: dict[Reagent, dict[Reagent, int]], max_time: int) -> int:
         name: max(blueprint[r].get(name, 0) for r in REAGENTS) for name in REAGENTS
     }
 
-    state_after_t: dict[int, set[State]] = {0: {State()}}
+    state_after_t: dict[int, set[State]] = {0: [State()]}
 
     for t in range(1, max_time + 1):
+
         # list of new states at the end of step t that we are going to prune later
         states_for_t: set[State] = set()
-        robots_that_can_be_built: list[Reagent]
 
         for state in state_after_t[t - 1]:
             robots_that_can_be_built = [
@@ -133,7 +136,7 @@ def run(blueprint: dict[Reagent, dict[Reagent, int]], max_time: int) -> int:
             for robot in robots_that_can_be_built:
                 robots = state.robots.copy()
                 robots[robot] += 1
-                reagents: IntOfReagent = {
+                reagents = {
                     reagent: state.reagents[reagent]
                     + state.robots[reagent]
                     - blueprint[robot].get(reagent, 0)
@@ -152,7 +155,7 @@ def run(blueprint: dict[Reagent, dict[Reagent, int]], max_time: int) -> int:
             ]
         )
 
-        to_keep: list[NDArray[np.integer[Any]]] = []
+        to_keep = []
         while len(np_states) > 0:
             first_dom = (np_states[1:] >= np_states[0]).all(axis=1).any()
 

2022/day2.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 
@@ -47,7 +49,7 @@ lines = sys.stdin.readlines()
 values = [(ord(row[0]) - ord("A"), ord(row[2]) - ord("X")) for row in lines]
 
 # part 1 - 13526
-print(f"answer 1 is {sum(score_1(*v) for v in values)}")
+print(f"score 1 is {sum(score_1(*v) for v in values)}")
 
 # part 2 - 14204
-print(f"answer 2 is {sum(score_2(*v) for v in values)}")
+print(f"score 2 is {sum(score_2(*v) for v in values)}")

2022/day20.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 from __future__ import annotations
 
 import sys
@@ -19,6 +21,7 @@ class Number:
 
 
 def decrypt(numbers: list[Number], key: int, rounds: int) -> int:
+
     numbers = numbers.copy()
     original = numbers.copy()
 

2022/day21.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import operator
 import sys
 from typing import Callable

2022/day22.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import re
 import sys
 from typing import Callable
@@ -124,6 +126,7 @@ def wrap_part_2(y0: int, x0: int, r0: str) -> tuple[int, int, str]:
 
 
 def run(wrap: Callable[[int, int, str], tuple[int, int, str]]) -> tuple[int, int, str]:
+
     y0 = 0
     x0 = np.where(board[0] == EMPTY)[0][0]
     r0 = "E"

2022/day23.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import itertools
 import sys
 from collections import defaultdict
@@ -39,7 +41,7 @@ def round(
     directions: Directions,
 ):
     to_move: dict[tuple[int, int], list[tuple[int, int]]] = defaultdict(lambda: [])
-    for y, x in positions:
+    for (y, x) in positions:
         elves = {
             (dy, dx): (y + dy, x + dx) in positions
             for dy, dx in itertools.product((-1, 0, 1), (-1, 0, 1))

2022/day24.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import heapq
 import math
 import sys

2022/day25.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 lines = sys.stdin.read().splitlines()

2022/day3.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import string
 import sys
 
@@ -11,7 +13,7 @@ priorities = {c: i + 1 for i, c in enumerate(string.ascii_letters)}
 
 # part 1
 part1 = sum(priorities[c] for p1, p2 in parts for c in p1.intersection(p2))
-print(f"answer 1 is {part1}")
+print(f"score 1 is {part1}")
 
 # part 2
 n_per_group = 3
@@ -20,4 +22,4 @@ part2 = sum(
     for i in range(0, len(lines), n_per_group)
     for c in set(lines[i]).intersection(*lines[i + 1 : i + n_per_group])
 )
-print(f"answer 2 is {part2}")
+print(f"score 2 is {part2}")

2022/day4.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 lines = [line.strip() for line in sys.stdin.readlines()]
@@ -10,8 +12,8 @@ def make_range(value: str) -> set[int]:
 
 sections = [tuple(make_range(part) for part in line.split(",")) for line in lines]
 
-answer_1 = sum(s1.issubset(s2) or s2.issubset(s1) for s1, s2 in sections)
-print(f"answer 1 is {answer_1}")
+score_1 = sum(s1.issubset(s2) or s2.issubset(s1) for s1, s2 in sections)
+print(f"score 1 is {score_1}")
 
-answer_2 = sum(bool(s1.intersection(s2)) for s1, s2 in sections)
-print(f"answer 1 is {answer_2}")
+score_2 = sum(bool(s1.intersection(s2)) for s1, s2 in sections)
+print(f"score 1 is {score_2}")

2022/day5.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import copy
 import sys
 

2022/day6.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 

2022/day7.py

@@ -1,3 +1,5 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 from pathlib import Path
 

2022/day8.py

@@ -1,7 +1,8 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 import numpy as np
-from numpy.typing import NDArray
 
 lines = sys.stdin.read().splitlines()
 
@@ -26,7 +27,7 @@ answer_1 = (highest_trees.min(axis=2) < trees).sum()
 print(f"answer 1 is {answer_1}")
 
 
-def viewing_distance(row_of_trees: NDArray[np.int_], value: int) -> int:
+def viewing_distance(row_of_trees: np.ndarray, value: int) -> int:
     w = np.where(row_of_trees >= value)[0]
 
     if not w.size:

2022/day9.py

@@ -1,9 +1,12 @@
+# -*- encoding: utf-8 -*-
+
 import sys
 
 import numpy as np
 
 
 def move(head: tuple[int, int], command: str) -> tuple[int, int]:
+
     h_col, h_row = head
 
     if command == "L":
@@ -19,6 +22,7 @@ def move(head: tuple[int, int], command: str) -> tuple[int, int]:
 
 
 def follow(head: tuple[int, int], tail: tuple[int, int]) -> tuple[int, int]:
+
     h_col, h_row = head
     t_col, t_row = tail
 
@@ -29,7 +33,8 @@ def follow(head: tuple[int, int], tail: tuple[int, int]) -> tuple[int, int]:
 
 
 def run(commands: list[str], n_blocks: int) -> list[tuple[int, int]]:
-    blocks: list[tuple[int, int]] = [(0, 0) for _ in range(n_blocks)]
+
+    blocks = [(0, 0) for _ in range(n_blocks)]
     visited = [blocks[-1]]
 
     for command in commands:

2023/day1.py

@@ -0,0 +1,45 @@
+import sys
+
+lines = sys.stdin.read().splitlines()
+
+lookups_1 = {str(d): d for d in range(1, 10)}
+lookups_2 = lookups_1 | {
+    d: i + 1
+    for i, d in enumerate(
+        (
+            "one",
+            "two",
+            "three",
+            "four",
+            "five",
+            "six",
+            "seven",
+            "eight",
+            "nine",
+        )
+    )
+}
+
+
+def find_values(lookups: dict[str, int]) -> list[int]:
+    values: list[int] = []
+
+    for line in filter(bool, lines):
+        first_digit = min(
+            lookups,
+            key=lambda lookup: index
+            if (index := line.find(lookup)) >= 0
+            else len(line),
+        )
+        last_digit = max(
+            lookups,
+            key=lambda lookup: index if (index := line.rfind(lookup)) >= 0 else -1,
+        )
+
+        values.append(10 * lookups[first_digit] + lookups[last_digit])
+
+    return values
+
+
+print(f"answer 1 is {sum(find_values(lookups_1))}")
+print(f"answer 2 is {sum(find_values(lookups_2))}")

2023/day10.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day11.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day12.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day13.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day14.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day15.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day16.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day17.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day18.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day19.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day2.py

@@ -0,0 +1,45 @@
+import operator
+import sys
+from functools import reduce
+from typing import Literal, TypeAlias, cast
+
+CubeType: TypeAlias = Literal["red", "blue", "green"]
+
+MAX_CUBES: dict[CubeType, int] = {"red": 12, "green": 13, "blue": 14}
+
+# parse games
+lines = sys.stdin.read().splitlines()
+games: dict[int, list[dict[CubeType, int]]] = {}
+for line in filter(bool, lines):
+    id_part, sets_part = line.split(":")
+
+    games[int(id_part.split(" ")[-1])] = [
+        {
+            cast(CubeType, s[1]): int(s[0])
+            for cube_draw in cube_set_s.strip().split(", ")
+            if (s := cube_draw.split(" "))
+        }
+        for cube_set_s in sets_part.strip().split(";")
+    ]
+
+# part 1
+answer_1 = sum(
+    id
+    for id, set_of_cubes in games.items()
+    if all(
+        n_cubes <= MAX_CUBES[cube]
+        for cube_set in set_of_cubes
+        for cube, n_cubes in cube_set.items()
+    )
+)
+print(f"answer 1 is {answer_1}")
+
+# part 2
+answer_2 = sum(
+    reduce(
+        operator.mul,
+        (max(cube_set.get(cube, 0) for cube_set in set_of_cubes) for cube in MAX_CUBES),
+    )
+    for set_of_cubes in games.values()
+)
+print(f"answer 2 is {answer_2}")

2023/day20.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day21.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day22.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day23.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day24.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day25.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from dataclasses import dataclass
 
 lines = sys.stdin.read().splitlines()
 

2023/day3.py

@@ -0,0 +1,53 @@
+import string
+import sys
+from collections import defaultdict
+
+NOT_A_SYMBOL = "." + string.digits
+
+lines = sys.stdin.read().splitlines()
+
+values: list[int] = []
+gears: dict[tuple[int, int], list[int]] = defaultdict(list)
+
+for i, line in enumerate(lines):
+    j = 0
+    while j < len(line):
+        # skip everything until a digit is found (start of a number)
+        if line[j] not in string.digits:
+            j += 1
+            continue
+
+        # extract the range of the number and its value
+        k = j + 1
+        while k < len(line) and line[k] in string.digits:
+            k += 1
+
+        value = int(line[j:k])
+
+        # lookup around the number if there is a symbol - we go through the number
+        # itself but that should not matter since it only contains digits
+        found = False
+        for i2 in range(max(0, i - 1), min(i + 1, len(lines) - 1) + 1):
+            for j2 in range(max(0, j - 1), min(k, len(line) - 1) + 1):
+                assert i2 >= 0 and i2 < len(lines)
+                assert j2 >= 0 and j2 < len(line)
+
+                if lines[i2][j2] not in NOT_A_SYMBOL:
+                    found = True
+
+                    if lines[i2][j2] == "*":
+                        gears[i2, j2].append(value)
+
+        if found:
+            values.append(value)
+
+        # continue starting from the end of the number
+        j = k
+
+# part 1
+answer_1 = sum(values)
+print(f"answer 1 is {answer_1}")
+
+# part 2
+answer_2 = sum(v1 * v2 for v1, v2 in filter(lambda vs: len(vs) == 2, gears.values()))
+print(f"answer 2 is {answer_2}")

2023/day4.py

@@ -0,0 +1,41 @@
+import sys
+from dataclasses import dataclass
+
+
+@dataclass(frozen=True)
+class Card:
+    id: int
+    numbers: list[int]
+    values: list[int]
+
+
+lines = sys.stdin.read().splitlines()
+
+cards: list[Card] = []
+for line in lines:
+    id_part, e_part = line.split(":")
+    numbers_s, values_s = e_part.split("|")
+    cards.append(
+        Card(
+            id=int(id_part.split()[1]),
+            numbers=[int(v.strip()) for v in numbers_s.strip().split()],
+            values=[int(v.strip()) for v in values_s.strip().split()],
+        )
+    )
+
+winnings = [sum(1 for n in card.values if n in card.numbers) for card in cards]
+
+# part 1
+answer_1 = sum(2 ** (winning - 1) for winning in winnings if winning > 0)
+print(f"answer 1 is {answer_1}")
+
+# part 2
+card2cards = {i: list(range(i + 1, i + w + 1)) for i, w in enumerate(winnings)}
+card2values = {i: 0 for i in range(len(cards))}
+
+for i in range(len(cards)):
+    card2values[i] += 1
+    for j in card2cards[i]:
+        card2values[j] += card2values[i]
+
+print(f"answer 2 is {sum(card2values.values())}")

2023/day5.py

@@ -0,0 +1,129 @@
+import sys
+from typing import Sequence
+
+MAP_ORDER = [
+    "seed",
+    "soil",
+    "fertilizer",
+    "water",
+    "light",
+    "temperature",
+    "humidity",
+    "location",
+]
+
+lines = sys.stdin.read().splitlines()
+
+# mappings from one category to another, each list contains
+# ranges stored as (source, target, length), ordered by start and
+# completed to have no "hole"
+maps: dict[tuple[str, str], list[tuple[int, int, int]]] = {}
+
+# parsing
+index = 2
+while index < len(lines):
+    p1, _, p2 = lines[index].split()[0].split("-")
+
+    # extract the existing ranges from the file - we store as (source, target, length)
+    # whereas the file is in order (target, source, length)
+    index += 1
+    values: list[tuple[int, int, int]] = []
+    while index < len(lines) and lines[index]:
+        n1, n2, n3 = lines[index].split()
+        values.append((int(n2), int(n1), int(n3)))
+        index += 1
+
+    # sort by source value
+    values.sort()
+
+    # add a 'fake' interval starting at 0 if missing
+    if values[0][0] != 0:
+        values.insert(0, (0, 0, values[0][0]))
+
+    # fill gaps between intervals
+    for i in range(len(values) - 1):
+        next_start = values[i + 1][0]
+        end = values[i][0] + values[i][2]
+        if next_start != end:
+            values.insert(
+                i + 1,
+                (end, end, next_start - end),
+            )
+
+    # add an interval covering values up to at least 2**32 at the end
+    last_start, _, last_length = values[-1]
+    values.append((last_start + last_length, last_start + last_length, 2**32))
+
+    assert all(v1[0] + v1[2] == v2[0] for v1, v2 in zip(values[:-1], values[1:]))
+    assert values[0][0] == 0
+    assert values[-1][0] + values[-1][-1] >= 2**32
+
+    maps[p1, p2] = values
+    index += 1
+
+
+def find_range(
+    values: tuple[int, int], map: list[tuple[int, int, int]]
+) -> list[tuple[int, int]]:
+    """
+    Given an input range, use the given mapping to find the corresponding list of
+    ranges in the target domain.
+    """
+    r_start, r_length = values
+    ranges: list[tuple[int, int]] = []
+
+    # find index of the first and last intervals in map that overlaps the input
+    # interval
+    index_start, index_end = -1, -1
+
+    for index_start, (start, _, length) in enumerate(map):
+        if start <= r_start and start + length > r_start:
+            break
+
+    for index_end, (start, _, length) in enumerate(
+        map[index_start:], start=index_start
+    ):
+        if r_start + r_length >= start and r_start + r_length < start + length:
+            break
+
+    assert index_start >= 0 and index_end >= 0
+
+    # special case if one interval contains everything
+    if index_start == index_end:
+        start, target, length = map[index_start]
+        ranges.append((target + r_start - start, r_length))
+    else:
+        # add the start interval part
+        start, target, length = map[index_start]
+        ranges.append((target + r_start - start, start + length - r_start))
+
+        # add all intervals between the first and last (excluding both)
+        index = index_start + 1
+        while index < index_end:
+            start, target, length = map[index]
+            ranges.append((target, length))
+            index += 1
+
+        # add the last interval
+        start, target, length = map[index_end]
+        ranges.append((target, r_start + r_length - start))
+
+    return ranges
+
+
+def find_location_ranges(seeds: Sequence[tuple[int, int]]) -> Sequence[tuple[int, int]]:
+    for map1, map2 in zip(MAP_ORDER[:-1], MAP_ORDER[1:]):
+        seeds = [s2 for s1 in seeds for s2 in find_range(s1, maps[map1, map2])]
+    return seeds
+
+
+# part 1 - use find_range() with range of length 1
+seeds_p1 = [(int(s), 1) for s in lines[0].split(":")[1].strip().split()]
+answer_1 = min(start for start, _ in find_location_ranges(seeds_p1))
+print(f"answer 1 is {answer_1}")
+
+# # part 2
+parts = lines[0].split(":")[1].strip().split()
+seeds_p2 = [(int(s), int(e)) for s, e in zip(parts[::2], parts[1::2])]
+answer_2 = min(start for start, _ in find_location_ranges(seeds_p2))
+print(f"answer 2 is {answer_2}")