ajet/advent-of-code
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

golf

Browse Source
This commit is contained in:
Adam Jeniski 2025-12-08 14:00:26 -10:00
parent e0fba7c72f
commit da7b893c37
1 changed files with 22 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
2025/src/day08.clj
View File

@ -11,8 +11,7 @@
(+ (square (- ax bx))
(square (- ay by))
(square (- az bz))))
(def closest-points
(->> (for [a input
(def closest-points (->> (for [a input
b input
:when (not= a b)]
#{a b})
@ -20,8 +19,9 @@
(map vec)
(sort-by (partial apply dist-squared))))
;; part 1
(->> closest-points
(take (count input))
(take 1000)
(reduce (fn [circuits [a b]]
(let [circuit-a (first (filter #(% a) circuits))
circuit-b (first (filter #(% b) circuits))]
@ -38,20 +38,19 @@
(map count)
(apply *))
(->> (loop [circuits circuits
[[a b] & rst] (take 10000 closest-points)]
;; part 2
(->> (take 6498 closest-points)
(reduce (fn [circuits [a b]]
(let [circuit-a (first (filter #(% a) circuits))
circuit-b (first (filter #(% b) circuits))]
(if (= circuit-a circuit-b)
(recur circuits rst)
circuits
(let [combined (clojure.set/union circuit-a circuit-b)
circuits' (-> circuits
(disj circuit-a)
(disj circuit-b)
(conj combined))]
circuits' (-> circuits (disj circuit-a) (disj circuit-b) (conj combined))]
(if (= 1 (count circuits'))
[a b]
(recur circuits' rst))))))
(reduced [a b])
circuits')))))
circuits)
(map first)
(apply *))