ajet/advent-of-code
1
0
Fork 0
mirror of https://github.com/Ajetski/advent-of-code.git synced 2025-11-27 12:12:44 -10:00
Code Issues Packages Projects Releases Wiki Activity

simplify. refactor in terms of pt 2 solution

Browse Source
This commit is contained in:
Adam Jeniski 2025-10-19 04:38:36 -09:00
parent 57c87a2c13
commit 43c69f4e0b
1 changed files with 10 additions and 81 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

91
2024/src/day19.clj
View File

@ -1,89 +1,15 @@
(ns day19
(:require
[clojure.string :as str] ; [core :as c]
input-manager
[orchard.pp :as pp]))
(def sample-input "r, wr, b, g, bwu, rb, gb, br
brwrr
bggr
gbbr
rrbgbr
ubwu
bwurrg
brgr
bbrgwb")
[clojure.string :as str]
input-manager))
(let [[w _ & p]
#_(str/split-lines sample-input)
(input-manager/get-input 2024 19)]
(def words (into #{} (str/split w #", ")))
(def puzzles p)
(def word-sizes (->> words
(map count)
distinct
sort
reverse)))
(defn p [x]
(println x)
x)
(defn next-search-index [puzzle searched valid-subsets]
(if (every? (complement true?) searched)
0
(some->> valid-subsets
(map-indexed vector)
(filter second)
(filter (fn [[idx :as el]]
(not (searched (inc idx)))))
last
first
inc)))
(defn find-valid-subsets [puzzle search-idx valid-subsets]
(let [max-idx (count puzzle)]
(->> word-sizes
(map (partial + search-idx)) ; get end pos
(filter #(<= % max-idx))
(map (partial subs puzzle search-idx)) ;get substrings
(filter words)
(map (comp (partial + search-idx) dec count))
(reduce (fn [acc idx]
(assoc acc idx true))
valid-subsets))))
(defn is-valid
([puzzle]
(is-valid puzzle
(mapv (constantly false) puzzle)
(mapv (constantly false) puzzle)
0))
([puzzle searched valid-subsets n]
(let [search-idx (next-search-index puzzle searched valid-subsets)]
(cond
(or (not search-idx)
(= search-idx -1))
false
(>= search-idx (count puzzle))
true
:else
(let [next-subsets (find-valid-subsets puzzle search-idx valid-subsets)]
(if (last next-subsets)
true
(recur puzzle
(assoc searched search-idx true)
next-subsets
(inc n))))))))
;; part 1 solution
(->> puzzles
(map is-valid)
(filter identity)
count)
distinct)))
(defn valid-combination-count
([puzzle]
@ -103,10 +29,13 @@ bbrgwb")
(map (partial + pos))
(reduce (fn [acc idx] (update acc idx (partial + weight)))
dp))]
(recur puzzle
(inc pos)
(or (get dp' pos) 0)
dp')))))
(recur puzzle (inc pos) (get dp' pos) dp')))))
;; part 1 solution
(->> puzzles
(map valid-combination-count)
(filter (partial < 0))
count)
;; part 2 solution
(->> puzzles