too lazy to think

give it a few hours see if we can just bruteforce this, since there's
no really memory pressure that we can run this as long as we want.

src/Javran/AdventOfCode/Y2023/Day5.hs

@@ -69,6 +69,8 @@ instance Solution Day5 where
   solutionSolved _ = False
   solutionRun _ SolutionContext {getInputS, answerShow} = do
     (seeds, maps) <- consumeOrDie almanacP <$> getInputS
-    let fs = fmap mkMapper maps
-        locs = foldl' (\xs f -> fmap f xs) seeds fs
-    answerShow (minimum locs)
+    let ff = foldl' (\r m -> mkMapper m . r) id maps
+    answerShow (minimum $ fmap ff seeds)
+    answerShow $ minimum do
+      [l, rng] <- chunksOf 2 seeds
+      fmap ff [l .. l + rng-1]