From c98a3a3cab44d5989dc51518a9c619898893b999 Mon Sep 17 00:00:00 2001 From: Julien Dessaux Date: Fri, 12 Jul 2024 00:22:27 +0200 Subject: 2023-21 part 1 in haskell --- 2023/21-Step_Counter/first.hs | 85 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 85 insertions(+) create mode 100644 2023/21-Step_Counter/first.hs (limited to '2023/21-Step_Counter/first.hs') diff --git a/2023/21-Step_Counter/first.hs b/2023/21-Step_Counter/first.hs new file mode 100644 index 0000000..ff7404f --- /dev/null +++ b/2023/21-Step_Counter/first.hs @@ -0,0 +1,85 @@ +-- requires cabal install --lib megaparsec parser-combinators heap vector +module Main (main) where + +import Control.Applicative.Permutations +import Control.Monad (void, when) +import qualified Data.Char as C +import Data.Either +import Data.Functor +import qualified Data.Heap as H +import qualified Data.List as L +import qualified Data.Map as M +import Data.Maybe +import qualified Data.Set as S +import qualified Data.Vector as V +import qualified Data.Vector.Unboxed as VU +import Data.Void (Void) +import Text.Megaparsec +import Text.Megaparsec.Char + +import Debug.Trace + +exampleExpectedOutput = 16 + +data Tile = Start | Plot | Rock deriving Eq +instance Show Tile where + show Start = "S" + show Plot = "." + show Rock = "#" +type Line = V.Vector Tile +type Input = V.Vector Line + +type Parser = Parsec Void String + +parseTile :: Parser Tile +parseTile = char 'S' $> Start + <|> char '.' $> Plot + <|> char '#' $> Rock + +parseLine :: Parser Line +parseLine = do + line <- some parseTile <* eol + return $ V.generate (length line) (line !!) + +parseInput' :: Parser Input +parseInput' = do + line <- some parseLine <* eof + return $ V.generate (length line) (line !!) + +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' + +type Steps = M.Map (Int, Int) () + +compute :: Input -> Int -> Int +compute input s = M.size $ compute' s start + where + compute' :: Int -> Steps -> Steps + compute' 0 steps = steps + compute' i steps = compute' (i-1) next + where + next :: Steps + next = M.foldrWithKey nextSteps M.empty steps + nextSteps :: (Int, Int) -> () -> Steps -> Steps + nextSteps (x, y) _ = nextOne (x-1, y) . nextOne (x+1, y) . nextOne (x, y-1) . nextOne (x, y+1) + nextOne :: (Int, Int) -> Steps -> Steps + nextOne (x, y) acc = case input V.!? y of + Just line -> case line V.!? x of + Just Rock -> acc + Just _ -> M.insert (x, y) () acc + _ -> acc + Nothing -> acc + start = M.singleton (mid, mid) () + mid = V.length input `div` 2 + +main :: IO () +main = do + example <- parseInput "example" + let exampleOutput = compute example 6 + when (exampleOutput /= exampleExpectedOutput) (error $ "example failed: got " ++ show exampleOutput ++ " instead of " ++ show exampleExpectedOutput) + input <- parseInput "input" + print $ compute input 64 -- cgit v1.2.3