Solve 2024 day 10

2024/d10.py

@@ -0,0 +1,36 @@
+from collections import deque
+from lib import Grid2D
+from lib import get_data
+
+
+data = get_data(__file__)
+g = Grid2D(data)
+starts = g.find("0")
+p1, p2 = 0, 0
+for start in starts:
+    n = 0
+    vertex = ((start,), start)
+    visited = set()
+    queue = deque([vertex])
+    nines = set()
+
+    while queue:
+        path, pos = queue.popleft()
+        if (path, pos) in visited:
+            continue
+        visited.add((path, pos))
+
+        if g[pos] == "9":
+            n += 1
+            nines.add(pos)
+            continue
+
+        for nb in g.neighbors_ort(pos):
+            if int(g[pos]) + 1 == int(g[nb]):
+                npath = tuple(list(path) + [nb])
+                queue.append((npath, nb))
+    p1 += len(nines)
+    p2 += n
+
+print(p1)
+print(p2)

README.md

@@ -300,4 +300,5 @@ and focus. Of course, learning more algorithms and techniques helps.
 - Day  7: `00:12:29  2058      0   00:13:08  1170      0`
 - Day  8: `00:15:59  1742      0   00:26:56  2190      0`
 - Day  9: `00:48:23  6055      0   01:09:38  3159      0`
+- Day 10: `00:19:47  2976      0   00:20:47  2244      0`