diff options
author | Julien Dessaux | 2024-12-21 01:16:43 +0100 |
---|---|---|
committer | Julien Dessaux | 2024-12-21 01:16:43 +0100 |
commit | 46beea085f7f0c6ac6cb36cc37bf149701cf4be0 (patch) | |
tree | fbb815e9f89578235b5acd721ac3a917028b3997 /2024/17-Chronospatial_Computer | |
parent | 2024-16 in haskell (diff) | |
download | advent-of-code-46beea085f7f0c6ac6cb36cc37bf149701cf4be0.tar.gz advent-of-code-46beea085f7f0c6ac6cb36cc37bf149701cf4be0.tar.bz2 advent-of-code-46beea085f7f0c6ac6cb36cc37bf149701cf4be0.zip |
2024-17 in haskell
Diffstat (limited to '2024/17-Chronospatial_Computer')
-rw-r--r-- | 2024/17-Chronospatial_Computer/example | 5 | ||||
-rw-r--r-- | 2024/17-Chronospatial_Computer/first.hs | 66 | ||||
-rw-r--r-- | 2024/17-Chronospatial_Computer/input | 5 | ||||
-rw-r--r-- | 2024/17-Chronospatial_Computer/second.hs | 76 |
4 files changed, 152 insertions, 0 deletions
diff --git a/2024/17-Chronospatial_Computer/example b/2024/17-Chronospatial_Computer/example new file mode 100644 index 0000000..f09839b --- /dev/null +++ b/2024/17-Chronospatial_Computer/example @@ -0,0 +1,5 @@ +Register A: 729 +Register B: 0 +Register C: 0 + +Program: 0,1,5,4,3,0 diff --git a/2024/17-Chronospatial_Computer/first.hs b/2024/17-Chronospatial_Computer/first.hs new file mode 100644 index 0000000..8c28db5 --- /dev/null +++ b/2024/17-Chronospatial_Computer/first.hs @@ -0,0 +1,66 @@ +-- requires cabal install --lib megaparsec parser-combinators heap vector +module Main (main) where + +import Control.Monad (void, when) +import Data.Bits +import Data.Functor +import qualified Data.List as L +import Data.Void (Void) +import Text.Megaparsec +import Text.Megaparsec.Char + +exampleExpectedOutput = "4,6,3,5,6,3,5,2,1,0" + +type Register = Int +type Op = Int +data Input = Input [Register] [Op] deriving Show + +type Parser = Parsec Void String + +parseNumber :: Parser Int +parseNumber = read <$> some digitChar + +parseRegister :: Parser Register +parseRegister = string "Register " *> (char 'A' <|> char 'B' <|> char 'C') *> string ": " *> parseNumber + +parseInput' :: Parser Input +parseInput' = Input <$> some (parseRegister <* eol) <* eol + <*> (string "Program: " *> some (parseNumber <* optional (char ',')) <* eol <* 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' + +type Pointer = Int +type PState = (Pointer, [Register], [Int]) + +compute :: Input -> String +compute (Input start ops) = L.intercalate "," . L.reverse . map show . (\(_, _, s) -> s) $ step (0, start, []) + where + end = length ops + step :: PState -> PState + step ps@(p, [a, b, c], _) | p == end = ps + | otherwise = step $ i ps co + where + i = [adv, bxl, bst, jnz, bxc, out, bdv, cdv] L.!! (ops L.!! p) + co = [0, 1, 2, 3, a, b, c] L.!! (ops L.!! (p+1)) + adv (p, [a, b, c], acc) n = (p+2, [a `div` (2 ^ n), b, c], acc) + bxl (p, [a, b, c], acc) n = (p+2, [a, xor b n, c], acc) + bst (p, [a, b, c], acc) n = (p+2, [a, n `mod` 8, c], acc) + jnz (p, [0, b, c], acc) n = (p+2, [0, b, c], acc) + jnz (p, [a, b, c], acc) n = (n, [a, b, c], acc) + bxc (p, [a, b, c], acc) _ = (p+2, [a, xor b c, c], acc) + out (p, [a, b, c], acc) n = (p+2, [a, b, c], (n `mod` 8) : acc) + bdv (p, [a, b, c], acc) n = (p+2, [a, a `div` (2 ^ n), c], acc) + cdv (p, [a, b, c], acc) n = (p+2, [a, b, a `div` (2 ^ n)], acc) + +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 diff --git a/2024/17-Chronospatial_Computer/input b/2024/17-Chronospatial_Computer/input new file mode 100644 index 0000000..6d69e23 --- /dev/null +++ b/2024/17-Chronospatial_Computer/input @@ -0,0 +1,5 @@ +Register A: 37283687 +Register B: 0 +Register C: 0 + +Program: 2,4,1,3,7,5,4,1,1,3,0,3,5,5,3,0 diff --git a/2024/17-Chronospatial_Computer/second.hs b/2024/17-Chronospatial_Computer/second.hs new file mode 100644 index 0000000..fa6d0b9 --- /dev/null +++ b/2024/17-Chronospatial_Computer/second.hs @@ -0,0 +1,76 @@ +-- requires cabal install --lib megaparsec parser-combinators heap vector +module Main (main) where + +import Control.Monad (void, when) +import Data.Bits +import Data.Functor +import qualified Data.List as L +import Data.Maybe +import Data.Void (Void) +import Text.Megaparsec +import Text.Megaparsec.Char + +type Register = Int +type Op = Int +data Input = Input [Register] [Op] deriving Show + +type Parser = Parsec Void String + +parseNumber :: Parser Int +parseNumber = read <$> some digitChar + +parseRegister :: Parser Register +parseRegister = string "Register " *> (char 'A' <|> char 'B' <|> char 'C') *> string ": " *> parseNumber + +parseInput' :: Parser Input +parseInput' = Input <$> some (parseRegister <* eol) <* eol + <*> (string "Program: " *> some (parseNumber <* optional (char ',')) <* eol <* 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' + +type Pointer = Int +type PState = (Pointer, [Register], [Int]) + +compute :: Input -> Int +compute (Input start ops) = minimum $ findA 0 (tail $ L.reverse $ L.tails ops) + where + findA :: Int -> [[Int]] -> [Int] + findA a [] = [a] + findA a (l:ls) = concatMap (\next -> findA next ls) nexts + where + candidates :: [Int] + candidates = [a*8..a*8+7] + steps :: [PState] + steps = map (\x -> step (0, [x, 0, 0], [])) candidates + outputs :: [[Int]] + outputs = map (\(_, [_, _, _], x') -> reverse x') steps + valids :: [Int] + valids = L.elemIndices l outputs + nexts :: [Int] + nexts = map (candidates L.!!) valids + end = length ops + step :: PState -> PState + step ps@(p, [a, b, c], _) | p == end = ps + | otherwise = step $ i ps co + where + i = [adv, bxl, bst, jnz, bxc, out, bdv, cdv] L.!! (ops L.!! p) + co = [0, 1, 2, 3, a, b, c] L.!! (ops L.!! (p+1)) + adv (p, [a, b, c], acc) n = (p+2, [a `div` (2 ^ n), b, c], acc) + bxl (p, [a, b, c], acc) n = (p+2, [a, xor b n, c], acc) + bst (p, [a, b, c], acc) n = (p+2, [a, n `mod` 8, c], acc) + jnz (p, [0, b, c], acc) n = (p+2, [0, b, c], acc) + jnz (p, [a, b, c], acc) n = (n, [a, b, c], acc) + bxc (p, [a, b, c], acc) _ = (p+2, [a, xor b c, c], acc) + out (p, [a, b, c], acc) n = (p+2, [a, b, c], (n `mod` 8) : acc) + bdv (p, [a, b, c], acc) n = (p+2, [a, a `div` (2 ^ n), c], acc) + cdv (p, [a, b, c], acc) n = (p+2, [a, b, a `div` (2 ^ n)], acc) + +main :: IO () +main = do + input <- parseInput "input" + print $ compute input |