1 -- Writeup at https://work.njae.me.uk/2022/12/03/advent-of-code-2022-day-3/
3 import System.Environment
5 import qualified Data.Set as S
9 type Contents = S.Set Char
10 data Rucksack = Rucksack String String deriving (Show, Eq)
14 do dataFileName <- getDataFileName
15 text <- readFile dataFileName
16 let rucksacks = fmap mkRucksack $ lines text
17 print $ part1 rucksacks
18 print $ part2 rucksacks
20 getDataFileName :: IO String
23 progName <- getProgName
24 let baseDataName = if null args
27 let dataFileName = "data/" ++ baseDataName ++ ".txt"
30 part1 :: [Rucksack] -> Int
31 part1 = sum . fmap (priority . commonItem)
33 part2 :: [Rucksack] -> Int
34 part2 rucksacks = sum $ fmap priority badges
35 where groups = chunksOf 3 rucksacks
36 badges = fmap badgeOf groups
38 merge :: Rucksack -> Contents
39 merge (Rucksack contents1 contents2) =
40 S.union (S.fromList contents1) (S.fromList contents2)
42 badgeOf :: [Rucksack] -> Char
43 badgeOf rucksacks = S.findMin $ intersections (fmap merge rucksacks)
45 intersections :: [Contents] -> Contents
46 intersections sets = foldl1' S.intersection sets
49 mkRucksack :: String -> Rucksack
50 mkRucksack contents = Rucksack (take n contents) (drop n contents)
51 where n = length contents `div` 2
53 commonItem :: Rucksack -> Char
54 commonItem (Rucksack contents1 contents2) = S.findMin (c1 `S.intersection` c2)
55 where c1 = S.fromList contents1
56 c2 = S.fromList contents2
58 priority :: Char -> Int
60 | item >= 'a' = ord item - ord 'a' + 1
61 | otherwise = ord item - ord 'A' + 27