aboutsummaryrefslogtreecommitdiff
path: root/2023/04-Scratchcards/second.hs
blob: 4921aa611cbd5002ada7b21ae40bd8b2451eb873 (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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
-- requires cabal install --lib megaparsec parser-combinators
module Main (main) where

import Control.Applicative.Permutations
import Control.Monad (void, when)
import Data.Char qualified as C
import Data.Either
import Data.List qualified as L
import Data.Map qualified as M
import Data.Maybe
import Data.Set qualified as S
import Data.Void (Void)
import Text.Megaparsec
import Text.Megaparsec.Char

import Debug.Trace

exampleExpectedOutput = 30

data Card = Card Int [Int] [Int] deriving Show
type Input = [Card]

type Parser = Parsec Void String

parseNumber :: Parser Int
parseNumber = read <$> some digitChar <* many (char ' ')

parseCard :: Parser Card
parseCard = do
  id <- string "Card" *> many (char ' ') *> parseNumber <* char ':' <* many (char ' ')
  winnings <- some parseNumber
  void $ char '|' <* many (char ' ')
  numbers <- some parseNumber
  return $ Card id winnings numbers

parseInput' :: Parser Input
parseInput' = some (parseCard <* 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'

compute :: Input -> Integer
compute = fst . L.foldl' compute' (0, L.repeat 1) . map score'
  where
    compute' :: (Integer, [Integer]) -> Int -> (Integer, [Integer])
    compute' (acc, stack) score = (acc', stack')
      where
        copies = head stack
        acc' = acc + copies
        (scored, remain) = L.splitAt score $ tail stack
        stack' = map (+ copies) scored ++ remain
    score' :: Card -> Int
    score' (Card _ winnings numbers) | wins == 0 = 0
                                     | otherwise = wins
      where
        wins = length $ winnings `L.intersect` numbers

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