1
0
Fork 0

Compare commits

..

No commits in common. "d54b9f9812a3849f95f5555b8f011e599c2fd9dd" and "2eecbe9980de5996054ffdd7662cfa2b99676874" have entirely different histories.

4 changed files with 8 additions and 1069 deletions

View File

@ -1,14 +1,13 @@
-- https://adventofcode.com/2024/day/1
import Data.List (elemIndices, sort)
import GHC.IO (unsafePerformIO)
import Data.List
import GHC.IO
input :: FilePath
input = "src/advent_of_code/2024/1.input"
-- entries :: ([Int], [Int])
-- entries = unzip $ map parse' $ unsafePerformIO $ lines <$> readFile input
entries = unsafePerformIO $ lines <$> readFile input
entries :: ([Int], [Int])
entries = unzip $ map parse' $ unsafePerformIO $ lines <$> readFile input
main :: IO ()
main = do
@ -21,10 +20,12 @@ main = do
parse' :: String -> (Int, Int)
parse' str = (read l, read r)
where
[l, r] = words str
l = take' str
r = reverse $ take' $ reverse str
take' = takeWhile (/= ' ')
solveP1 :: ([Int], [Int]) -> Int
solveP1 (as, bs) = sum $ map abs $ zipWith subtract as' bs'
solveP1 (as, bs) = sum $ zipWith (\i j -> abs (i - j)) as' bs'
where
as' = sort as
bs' = sort bs

View File

@ -1,56 +0,0 @@
-- https://adventofcode.com/2024/day/2
{-# LANGUAGE OverloadedStrings #-}
import Data.List hiding (lines)
import Data.Text (Text, lines, pack, splitOn, unpack)
import Data.Text.IO (readFile)
import GHC.IO (unsafePerformIO)
import Prelude hiding (lines, readFile)
entries :: [[Int]]
entries = parse . unsafePerformIO $ lines <$> readFile "src/advent_of_code/2024/2.input"
entries' :: [[Int]]
entries' = parse . unsafePerformIO $ lines <$> readFile "src/advent_of_code/2024/2f.input"
parse :: [Text] -> [[Int]]
parse = map (map (read . unpack) . splitOn " ")
main :: IO ()
main = do
entries <- parse . lines <$> readFile "src/advent_of_code/2024/2.input"
print "Advent of Code 2024 - Day 2"
print $ "Part 1: " <> show (solveP1 entries)
print $ "Part 2: " <> show (solveP2 entries)
solveP1 :: [[Int]] -> Int
solveP1 = length . filter (== True) . map safeReport
safeReport :: [Int] -> Bool
safeReport report = isSorted && adjacentLevelCheck
where
isSorted = sortedReportASC == report || sortedReportDESC == report
sortedReportASC = sort report
sortedReportDESC = reverse sortedReportASC
adjacentLevelCheck =
all (((== True) . (\n-> n>=1 && n<=3)) . abs)
(zipWith subtract report (tail report))
solveP2 :: [[Int]] -> Int
solveP2 = length . filter (== True) . map safeReport'
safeReport' :: [Int] -> Bool
safeReport' report =
or $ zipWith (&&) (map adjacentLevelCheck reports) (map isSorted reports)
where
isSorted report = report `elem` [sort report, reverse (sort report)]
adjacentLevelCheck report =
all (((== True) . (\n-> n>=1 && n<=3)) . abs)
(zipWith subtract report (tail report))
reports = map tail $ permutations report

File diff suppressed because it is too large Load Diff

View File

@ -1,6 +0,0 @@
7 6 4 2 1
1 2 7 8 9
9 7 6 2 1
1 3 2 4 5
8 6 4 4 1
1 3 6 7 9