- Tweets 123
- Following 43
- Followers 15
- Likes 150
ALT type PairInsertionMap = M.Map String Char type PairCountMap = M.Map String Int sim :: Int -> PairInsertionMap -> PairCountMap -> PairCountMap sim 0 _ cm = cm sim n im cm = sim (n - 1) im cm' where cm' = step im cm step :: PairInsertionMap -> PairCountMap -> PairCountMap step im cm = M.fromListWith ( ) $ concatMap transform (M.toList cm) where transform (s, i) = let (a, b) = insert im s in [(a, i)...
![score :: String -> PairCountMap -> Int
score s cm = (maximum counts - minimum counts) `div` 2
where
counts :: [Int]
counts = map (count s cm) chars
count :: String -> PairCountMap -> Char -> Int
count s cm ch = sum (map (flip (M.findWithDefault 0) cm) (keysWith ch)) extra s ch cm
chars :: [Char]
chars = nub $ concat $ M.keys cm
keys :: [String]
keys = [[a, b] | a <- chars, b ...](https://venexa.site/media/FGmHK-mVEAML97j.jpg)
ALT score :: String -> PairCountMap -> Int score s cm = (maximum counts - minimum counts) `div` 2 where counts :: [Int] counts = map (count s cm) chars count :: String -> PairCountMap -> Char -> Int count s cm ch = sum (map (flip (M.findWithDefault 0) cm) (keysWith ch)) extra s ch cm chars :: [Char] chars = nub $ concat $ M.keys cm keys :: [String] keys = [[a, b] | a <- chars, b ...
![printCode :: PointSet -> IO ()
printCode ps = do
putStrLn ""
mapM_ print (Util.group (fst max 1) drawn)
where
drawn = map (\p -> if S.member p ps then '#' else ' ') grid
grid = [(x, y) | y <- [0 .. snd max], x <- [0 .. fst max]]
max = (maximum (map fst ls), maximum (map snd ls))
ls = S.toList ps](https://venexa.site/media/FGggWkXVIAENOEt.jpg)
ALT printCode :: PointSet -> IO () printCode ps = do putStrLn "" mapM_ print (Util.group (fst max 1) drawn) where drawn = map (\p -> if S.member p ps then '#' else ' ') grid grid = [(x, y) | y <- [0 .. snd max], x <- [0 .. fst max]] max = (maximum (map fst ls), maximum (map snd ls)) ls = S.toList ps
![syntaxErrorScore :: [String] -> Int
syntaxErrorScore ls = sum $ map (score . firstInvalidChar []) ls
firstInvalidChar :: [Char] -> String -> Char
firstInvalidChar _ [] = ' '
firstInvalidChar c (x : xs)
| x `elem` ['(', '[', '{', '<'] = firstInvalidChar (x : c) xs
| pair (head c) x = firstInvalidChar (tail c) xs
| otherwise = x
where
pair '(' ')' = True
pair '[' ']' = True
pair '{' '}' = True
...](https://venexa.site/media/FGOkogWUcAIaMPj.jpg)
ALT syntaxErrorScore :: [String] -> Int syntaxErrorScore ls = sum $ map (score . firstInvalidChar []) ls firstInvalidChar :: [Char] -> String -> Char firstInvalidChar _ [] = ' ' firstInvalidChar c (x : xs) | x `elem` ['(', '[', '{', '<'] = firstInvalidChar (x : c) xs | pair (head c) x = firstInvalidChar (tail c) xs | otherwise = x where pair '(' ')' = True pair '[' ']' = True pair '{' '}' = True ...
![autocompleteScore :: [String] -> Int
autocompleteScore ls = scores !! (length scores `div` 2)
where
autocompletes = map (completeLine []) (getIncompleteLines ls)
scores = sort $ map (foldl (\a x -> (a * 5) x) 0 . map score') autocompletes
getIncompleteLines :: [String] -> [String]
getIncompleteLines lines = [x | (i, x) <- zip [0 ..] lines, lines' !! i == ' ']
where
lines' = map (firstInvalidChar...](https://venexa.site/media/FGOk5sgVkAEQg1F.jpg)
ALT autocompleteScore :: [String] -> Int autocompleteScore ls = scores !! (length scores `div` 2) where autocompletes = map (completeLine []) (getIncompleteLines ls) scores = sort $ map (foldl (\a x -> (a * 5) x) 0 . map score') autocompletes getIncompleteLines :: [String] -> [String] getIncompleteLines lines = [x | (i, x) <- zip [0 ..] lines, lines' !! i == ' '] where lines' = map (firstInvalidChar...
![d7p1 :: [Int] -> IO ()
d7p1 input = print $ minimum $ map (totalDistance input) [minimum input .. maximum input]
d7p2 :: [Int] -> IO ()
d7p2 input = print $ minimum $ map (totalDistance' input) [minimum input .. maximum input]
totalDistance :: [Int] -> Int -> Int
totalDistance p i = sum $ map (\x -> curry distance x i) p
totalDistance' :: [Int] -> Int -> Int
totalDistance' p i = sum $ map (\x -> curry distance'...](https://venexa.site/media/FF_J096VUAIhNI3.jpg)
ALT d7p1 :: [Int] -> IO () d7p1 input = print $ minimum $ map (totalDistance input) [minimum input .. maximum input] d7p2 :: [Int] -> IO () d7p2 input = print $ minimum $ map (totalDistance' input) [minimum input .. maximum input] totalDistance :: [Int] -> Int -> Int totalDistance p i = sum $ map (\x -> curry distance x i) p totalDistance' :: [Int] -> Int -> Int totalDistance' p i = sum $ map (\x -> curry distance'...
![d6p1 :: [Int] -> IO ()
d6p1 input = print $ sum $ sim 80 (mkFish input)
d6p2 :: [Int] -> IO ()
d6p2 input = print $ sum $ sim 256 (mkFish input)
count :: Eq a => a -> [a] -> Int
count x = length . filter (== x)
mkFish :: [Int] -> [Int]
mkFish input = [count x input | x <- [0 .. 8]]
sim :: Int -> [Int] -> [Int]
sim 0 f = f
sim c f = sim (c - 1) (next f)
next :: [Int] -> [Int]
next [d0, d1, d2, d3, d4, d5, d6, ...](https://venexa.site/media/FF8j2p6VkAMRyjz.jpg)
ALT d6p1 :: [Int] -> IO () d6p1 input = print $ sum $ sim 80 (mkFish input) d6p2 :: [Int] -> IO () d6p2 input = print $ sum $ sim 256 (mkFish input) count :: Eq a => a -> [a] -> Int count x = length . filter (== x) mkFish :: [Int] -> [Int] mkFish input = [count x input | x <- [0 .. 8]] sim :: Int -> [Int] -> [Int] sim 0 f = f sim c f = sim (c - 1) (next f) next :: [Int] -> [Int] next [d0, d1, d2, d3, d4, d5, d6, ...
![import Data.Foldable (find)
import qualified Data.Map.Strict as M
d6p1 :: [Int] -> IO ()
d6p1 input = do
let fish = fishCounts $ zip input (repeat 1)
print $ sum $ map snd $ simulate 80 fish
d6p2 :: [Int] -> IO ()
d6p2 input = do
let fish = fishCounts $ zip input (repeat 1)
print $ sum $ map snd $ simulate 256 fish
fishCounts :: (Ord k, Num a) => [(k, a)] -> [(k, a)]
fishCounts fish = M.toList $ M.fromL...](https://venexa.site/media/FF6neJsUUAAJYpZ.jpg)
ALT import Data.Foldable (find) import qualified Data.Map.Strict as M d6p1 :: [Int] -> IO () d6p1 input = do let fish = fishCounts $ zip input (repeat 1) print $ sum $ map snd $ simulate 80 fish d6p2 :: [Int] -> IO () d6p2 input = do let fish = fishCounts $ zip input (repeat 1) print $ sum $ map snd $ simulate 256 fish fishCounts :: (Ord k, Num a) => [(k, a)] -> [(k, a)] fishCounts fish = M.toList $ M.fromL...
![genPoints :: Part -> Line -> [Point]
genPoints part l@(Line x1 y1 x2 y2)
| x1 == x2 && y1 < y2 = zip (repeat x1) [y1 .. y2]
| x1 == x2 && y2 < y1 = zip (repeat x1) [y2 .. y1]
| y1 == y2 && x1 < x2 = zip [x1 .. x2] (repeat y1)
| y1 == y2 && x2 < x1 = zip [x2 .. x1] (repeat y1)
| otherwise = case part of
PartOne -> []
PartTwo -> diag l
diag :: Line -> [Point]
diag (Line x1 y1 x2 y2)
| x1 < x2 &&...](https://venexa.site/media/FF32k1iVUAQ4zXx.jpg)
ALT genPoints :: Part -> Line -> [Point] genPoints part l@(Line x1 y1 x2 y2) | x1 == x2 && y1 < y2 = zip (repeat x1) [y1 .. y2] | x1 == x2 && y2 < y1 = zip (repeat x1) [y2 .. y1] | y1 == y2 && x1 < x2 = zip [x1 .. x2] (repeat y1) | y1 == y2 && x2 < x1 = zip [x2 .. x1] (repeat y1) | otherwise = case part of PartOne -> [] PartTwo -> diag l diag :: Line -> [Point] diag (Line x1 y1 x2 y2) | x1 < x2 &&...