d0488726a0
This breaks less code than adding it to the solution functions, and is more elegant in a way.
54 lines
1.3 KiB
Haskell
54 lines
1.3 KiB
Haskell
module Puzzles.Day5 (puzzle) where
|
|
|
|
import Pre
|
|
|
|
import Data.Text.Lazy qualified as TL
|
|
|
|
puzzle :: Puzzle
|
|
puzzle =
|
|
Puzzle
|
|
{ number = 5
|
|
, parser = const do
|
|
ranges <- flip sepEndBy newline $ Range <$> decimal <* single '-' <*> decimal
|
|
void newline
|
|
vals <- sepEndBy decimal newline
|
|
pure (ranges, vals)
|
|
, parts =
|
|
[ \(ranges, vals) ->
|
|
TL.show
|
|
. length
|
|
. filter (flip any ranges . isInRange)
|
|
$ vals
|
|
, TL.show
|
|
. sum
|
|
. map rangeLength
|
|
. foldr addInterval []
|
|
. sortOn (Down . (.lower))
|
|
. fst
|
|
]
|
|
, extraTests = mempty
|
|
}
|
|
|
|
data Range = Range
|
|
{ lower :: Int
|
|
, upper :: Int
|
|
}
|
|
deriving (Eq, Ord, Show)
|
|
|
|
rangeLength :: Range -> Int
|
|
rangeLength r = r.upper - r.lower + 1
|
|
|
|
isInRange :: Int -> Range -> Bool
|
|
isInRange n r = n >= r.lower && n <= r.upper
|
|
|
|
extend :: Int -> Range -> Range
|
|
extend upper r = r{upper = max r.upper upper}
|
|
|
|
addInterval :: Range -> [Range] -> [Range]
|
|
addInterval new = \case
|
|
[] -> [new]
|
|
(r : rs) ->
|
|
if isInRange new.lower r
|
|
then extend new.upper r : rs
|
|
else new : r : rs
|