George Thomas 415055dcc2 Allow output types to vary for different parts of same day
For now this applies to Haskell only, and it may turn out to be tricky for the Rust implementation.

In practice, the limitation hasn't turned out to be important, and we could even go the other way and use `Integer` everywhere. This does however at least help with debugging, as well as just being conceptually right.

The `nil` and `(/\)` functions are intended to be overloaded to work for other list-like things in a later commit, and from there we will investigate using `OverloadedLists` and `RebindableSyntax` to recover standard list syntax, although there are probably limitations due to `(:)` being special.
2025-12-16 16:15:11 +00:00

52 lines
1.6 KiB
Haskell

module Puzzles.Day10 (puzzle) where
import Pre
import Data.IntMap qualified as IM
puzzle :: Puzzle
puzzle =
Puzzle
{ number = 10
, parser = const $ flip sepEndBy newline do
void $ single '['
lights <- some $ (single '.' $> Off) <|> (single '#' $> On)
void $ single ']'
void space1
switches <- flip sepEndBy space1 do
void $ single '('
r <- Switch <$> decimal `sepBy` single ','
void $ single ')'
pure r
void $ single '{'
void $ decimal @_ @_ @_ @Int `sepBy` single ','
void $ single '}'
pure (Lights $ IM.fromList $ zip [0 ..] lights, switches)
, parts =
( sum . map \(lights, switches) ->
maybe (error "no solution") length
. firstJust (firstJust (\(s, ls) -> guard (allOff ls) $> s))
$ flip iterate [([], lights)] \ls ->
concatMap (\s -> map (\(ss, l) -> (s : ss, applySwitch s l)) ls) switches
)
/\ nil
, extraTests = mempty
}
data Light = On | Off
deriving (Eq, Ord, Show)
flipLight :: Light -> Light
flipLight = \case
On -> Off
Off -> On
newtype Lights = Lights (IM.IntMap Light)
deriving (Eq, Ord, Show)
allOff :: Lights -> Bool
allOff (Lights ls) = all (== Off) $ map snd $ IM.toList ls
newtype Switch = Switch [Int]
deriving (Eq, Ord, Show)
applySwitch :: Switch -> Lights -> Lights
applySwitch (Switch ss) (Lights ls) = Lights $ foldl' (flip $ IM.adjust flipLight) ls ss