Add solution to 2025-12-08

Author: fuglede

2025/day08/solutions.py

@@ -0,0 +1,18 @@
+from itertools import combinations
+from math import dist, prod
+from scipy.cluster.hierarchy import DisjointSet
+
+with open("input") as f:
+    ls = f.read().strip().split("\n")
+
+ns = [tuple(map(int, l.split(","))) for l in ls]
+edges = sorted(combinations(ns, 2), key=lambda pair: dist(*pair))
+
+ds = DisjointSet(ns)
+for i, (n1, n2) in enumerate(edges):
+    if i == 1000:
+        print(prod(sorted(map(len, ds.subsets()))[-3:]))
+    ds.merge(n1, n2)
+    if ds.n_subsets == 1:
+        print(n1[0] * n2[0])
+        break