aboutsummaryrefslogtreecommitdiff
path: root/2024/05-Print_Queue/second.hs
diff options
context:
space:
mode:
authorJulien Dessaux2024-12-05 10:04:11 +0100
committerJulien Dessaux2024-12-05 10:04:11 +0100
commit3d7a069b71a26f78cb00a1ff0292cb28d501c167 (patch)
treeacc18575939200483a549da4a3801c200a81458b /2024/05-Print_Queue/second.hs
parent2024-04 in haskell (diff)
downloadadvent-of-code-3d7a069b71a26f78cb00a1ff0292cb28d501c167.tar.gz
advent-of-code-3d7a069b71a26f78cb00a1ff0292cb28d501c167.tar.bz2
advent-of-code-3d7a069b71a26f78cb00a1ff0292cb28d501c167.zip
2024-05 in haskell
Diffstat (limited to '2024/05-Print_Queue/second.hs')
-rw-r--r--2024/05-Print_Queue/second.hs57
1 files changed, 57 insertions, 0 deletions
diff --git a/2024/05-Print_Queue/second.hs b/2024/05-Print_Queue/second.hs
new file mode 100644
index 0000000..1ff555f
--- /dev/null
+++ b/2024/05-Print_Queue/second.hs
@@ -0,0 +1,57 @@
+-- requires cabal install --lib megaparsec parser-combinators heap vector
+module Main (main) where
+
+import Control.Monad (void, when)
+import qualified Data.List as L
+import Data.Void (Void)
+import Text.Megaparsec
+import Text.Megaparsec.Char
+
+exampleExpectedOutput = 123
+
+type Rule = (Int, Int)
+type Update = [Int]
+data Input = Input [Rule] [Update] deriving Show
+
+type Parser = Parsec Void String
+
+parseNumber :: Parser Int
+parseNumber = read <$> some digitChar
+
+parseRule :: Parser Rule
+parseRule = (,) <$> parseNumber <* char '|'
+ <*> parseNumber <* eol
+
+parseUpdate :: Parser Update
+parseUpdate = some (parseNumber <* optional (char ',')) <* eol
+
+parseInput' :: Parser Input
+parseInput' = Input <$> some parseRule <* eol
+ <*> some parseUpdate <* eof
+
+parseInput :: String -> IO Input
+parseInput filename = do
+ input <- readFile filename
+ case runParser parseInput' filename input of
+ Left bundle -> error $ errorBundlePretty bundle
+ Right input' -> return input'
+
+compute :: Input -> Int
+compute (Input rules updates) = sum $ map compute' invalids
+ where
+ invalids = L.filter (not . valid) updates
+ valid update = all (valid' update) rules
+ valid' update (x, y) = case (L.elemIndices x update, L.elemIndices y update) of
+ ([i], [j]) -> i < j
+ _ -> True
+ compute' update = (L.sortBy sortByRule update) !! (length update `div` 2)
+ sortByRule :: Int -> Int -> Ordering
+ sortByRule x y = if L.elem (x, y) rules then LT else GT
+
+main :: IO ()
+main = do
+ example <- parseInput "example"
+ let exampleOutput = compute example
+ when (exampleOutput /= exampleExpectedOutput) (error $ "example failed: got " ++ show exampleOutput ++ " instead of " ++ show exampleExpectedOutput)
+ input <- parseInput "input"
+ print $ compute input