From 8b9f68dc46ba619a94686002805766618f214e5a Mon Sep 17 00:00:00 2001
From: Marvin Borner
Date: Thu, 27 Jun 2024 16:13:02 +0200
Subject: Code

---
 naive.py | 47 +++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)
 create mode 100644 naive.py

(limited to 'naive.py')

diff --git a/naive.py b/naive.py
new file mode 100644
index 0000000..5f9b0fc
--- /dev/null
+++ b/naive.py
@@ -0,0 +1,47 @@
+cubes = [
+    tuple(int(n) for n in line.strip().split(","))
+    for line in open("input").readlines()
+]
+
+
+def neighbors(cube):
+    x, y, z = cube
+    return {(x + 1, y, z), (x - 1, y, z), (x, y + 1, z), (x, y - 1, z), (x, y, z + 1), (x, y, z - 1)}
+
+
+n = 0
+for cube in cubes:
+    for neighbor in neighbors(cube):
+        if neighbor not in cubes:
+            n += 1
+print(n)
+
+xmax = max(x for x, _, _ in cubes) + 1
+xmin = min(x for x, _, _ in cubes) - 1
+ymax = max(y for _, y, _ in cubes) + 1
+ymin = min(y for _, y, _ in cubes) - 1
+zmax = max(z for _, _, z in cubes) + 1
+zmin = min(z for _, _, z in cubes) - 1
+
+
+def in_boundary(cube):
+    x, y, z = cube
+    return xmin <= x <= xmax and ymin <= y <= ymax and zmin <= z <= zmax
+
+
+n = 0  # result
+visited = set(cubes)
+queue = [(xmax, ymax, zmax)]
+while queue:
+    cube = queue.pop(0)
+    for neighbor in neighbors(cube):
+        if not in_boundary(neighbor):
+            continue
+        if neighbor in cubes:
+            n += 1
+        if neighbor in visited:
+            continue
+        visited.add(neighbor)
+        queue.append(neighbor)
+
+print(n)
-- 
cgit v1.2.3