aboutsummaryrefslogtreecommitdiff
path: root/2023/13-Point_of_Incidence/second.hs
blob: cf294abe0c8c7059eaf96873ffce8ba1ca1cb336 (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
70
71
72
73
74
75
-- 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.Functor
import Data.List qualified as L
import Data.Map qualified as M
import Data.Maybe
import Data.Set qualified as S
import Data.Vector qualified as V
import Data.Void (Void)
import Text.Megaparsec
import Text.Megaparsec.Char

import Debug.Trace

exampleExpectedOutput = 400

data Tile = Ash | Rock deriving (Eq)
instance Show Tile where
  show Ash = "."
  show Rock = "#"
type Row = [Tile]
type Pattern = [Row]
type Input = [Pattern]

type Parser = Parsec Void String

parseTile :: Parser Tile
parseTile = char '.' $> Ash
        <|> char '#' $> Rock

parseRow :: Parser Row
parseRow = some parseTile <* eol

parsePattern :: Parser Pattern
parsePattern = some parseRow <* eol

parseInput' :: Parser Input
parseInput' = some parsePattern <* 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 -> Int
compute = sum . map findMirror
  where
    findMirror :: Pattern -> Int
    findMirror xs = 100 * findMirrors xs 1 + findMirrors (L.transpose xs) 1
    findMirrors :: Pattern -> Int -> Int
    findMirrors xs i | i == length xs = 0
                     | diffs == 1 = i
                     | otherwise = next
      where
        (is, ts) = L.splitAt i xs
        next = findMirrors xs (i+1)
        is' = reverse is -- we need to flip the left side
        diffs = sum $ zipWith diff is' ts
        diff :: Row -> Row -> Int
        diff as bs = length . L.filter id $ zipWith (/=) as bs

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