aboutsummaryrefslogtreecommitdiff
path: root/2020/15-Rambunctious_Recitation/second.hs
blob: eeac0d82a6964dabdec24cdeedee6492bb2432a0 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
-- requires cabal install --lib megaparsec parser-combinators
module Main (main) where
import Control.Monad (void, when)
import Data.List (foldl')
import Data.Map qualified as M
import Data.Void (Void)
import Text.Megaparsec
import Text.Megaparsec.Char
import System.Exit (die)

exampleExpectedOutput = 175594

type Input = [Int]

type Parser = Parsec Void String

parseInt :: Parser Int
parseInt = do
  n <- some digitChar
  void $ optional (char ',')
  return $ read n

parseOps :: Parser Input
parseOps = some parseInt <* char '\n' <* eof

parseInput :: String -> IO Input
parseInput filename = do
  input <- readFile filename
  case runParser parseOps filename input of
    Left bundle -> die $ errorBundlePretty bundle
    Right ops -> return ops

compute :: Input -> Int
compute input = compute'  (length input)  (foldl' prepare M.empty $ zip (init input) [1..])  (last input)
  where
    compute' :: Int -> M.Map Int (Int, Int) -> Int -> Int
    compute' 30_000_000 _ n = n
    compute' t m n = case M.lookup n m of
      Just (t', i) -> compute'  (t+1)  (M.insert n (t, i+1) m)  (t - t')
      Nothing -> compute'  (t+1)  (M.insert n (t, 0) m)  0
    prepare :: M.Map Int (Int, Int) -> (Int, Int) -> M.Map Int (Int, Int)
    prepare acc (n, t) = case M.lookup n acc of
      Just (_, i) -> M.insert n (t, i+1) acc
      Nothing -> M.insert n (t, 0) acc

main :: IO ()
main = do
  example <- parseInput "example"
  let exampleOutput = compute example
  when  (exampleOutput /= exampleExpectedOutput)  (die $ "example failed: got " ++ show exampleOutput ++ " instead of " ++ show exampleExpectedOutput)
  input <- parseInput "input"
  print $ compute input