aboutsummaryrefslogtreecommitdiff
path: root/2023/05-If_You_Give_A_Seed_A_Fertilizer/first.hs
blob: 18d030bab9f6e443b04c002144cf64f8450daeaa (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
-- 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

exampleExpectedOutput = 35

data Map = Map Int Int Int deriving Show -- destination source range
data Mapping = Mapping String String [Map] deriving Show -- sourceStr destStr
data Input = Input [Int] [Mapping] deriving Show -- seeds mappings

type Parser = Parsec Void String

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

parseMap :: Parser Map
parseMap = Map <$> parseNumber
               <*> parseNumber
               <*> parseNumber <* eol

parseMapping :: Parser Mapping
parseMapping = Mapping <$> (some letterChar <* string "-to-")
                       <*> (some letterChar <* string " map:" <* eol)
                       <*> some parseMap <* optional eol

parseInput' :: Parser Input
parseInput' = Input <$> (string "seeds: " *> some parseNumber <* some eol)
                    <*> some parseMapping <* 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'

step :: [Map] -> Int -> Int
step [] n = n
step (Map dest src range:ms) n | n>=src && n<src+range = n - src + dest
                               | otherwise = step ms n

stepMapping :: [Int] -> Mapping -> [Int]
stepMapping values (Mapping _ _ ms) = map (step ms) values

compute :: Input -> Int
compute (Input values mappings) = minimum $ L.foldl' stepMapping values mappings

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