2024-09 in haskell
This commit is contained in:
parent
3e098a4eed
commit
cd08dcce0c
4 changed files with 125 additions and 0 deletions
1
2024/09-Disk_Fragmenter/example
Normal file
1
2024/09-Disk_Fragmenter/example
Normal file
|
@ -0,0 +1 @@
|
|||
2333133121414131402
|
52
2024/09-Disk_Fragmenter/first.hs
Normal file
52
2024/09-Disk_Fragmenter/first.hs
Normal file
|
@ -0,0 +1,52 @@
|
|||
-- requires cabal install --lib megaparsec parser-combinators heap vector
|
||||
module Main (main) where
|
||||
|
||||
import Control.Monad (void, when)
|
||||
import qualified Data.List as L
|
||||
import Data.Void (Void)
|
||||
import Text.Megaparsec
|
||||
import Text.Megaparsec.Char
|
||||
|
||||
exampleExpectedOutput = 1928
|
||||
|
||||
type Input = [Int]
|
||||
|
||||
type Parser = Parsec Void String
|
||||
|
||||
parseBlockSize :: Parser Int
|
||||
parseBlockSize = read . pure <$> digitChar
|
||||
|
||||
parseInput' :: Parser Input
|
||||
parseInput' = some parseBlockSize <* eol <* 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 input = sum $ map (\(x, y) -> x * y) $ zip [0..] $ computeFile files' free []
|
||||
where
|
||||
files = [s | (i,s)<-zip [0..] input, even i]
|
||||
files' = zip [0..] files
|
||||
free = [s | (i,s)<-zip [0..] input, odd i]
|
||||
computeFile :: [(Int, Int)] -> [Int] -> [Int] -> [Int]
|
||||
computeFile ((fId, fSize):fs) free acc = computeFillFree fs free (acc ++ L.replicate fSize fId)
|
||||
computeFillFree :: [(Int, Int)] -> [Int] -> [Int] -> [Int]
|
||||
computeFillFree [] _ acc = acc
|
||||
computeFillFree files (free:frees) acc | free == fSize = computeFile fs frees (acc ++ L.replicate fSize fId)
|
||||
| free > fSize = computeFillFree fs (free-fSize:frees) (acc ++ L.replicate fSize fId)
|
||||
| free < fSize = computeFile (fs++[(fId, fSize-free)]) frees (acc ++ L.replicate free fId)
|
||||
where
|
||||
(fId, fSize) = last files
|
||||
fs = init files
|
||||
|
||||
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
|
1
2024/09-Disk_Fragmenter/input
Normal file
1
2024/09-Disk_Fragmenter/input
Normal file
File diff suppressed because one or more lines are too long
71
2024/09-Disk_Fragmenter/second.hs
Normal file
71
2024/09-Disk_Fragmenter/second.hs
Normal file
|
@ -0,0 +1,71 @@
|
|||
-- requires cabal install --lib megaparsec parser-combinators heap vector
|
||||
-- very slow with runghc, use ghc -O3 -o second second.hs and get the result in seconds
|
||||
module Main (main) where
|
||||
|
||||
import Control.Monad (void, when)
|
||||
import qualified Data.List as L
|
||||
import Data.Maybe
|
||||
import qualified Data.Vector as V
|
||||
import Data.Void (Void)
|
||||
import Text.Megaparsec
|
||||
import Text.Megaparsec.Char
|
||||
|
||||
exampleExpectedOutput = 2858
|
||||
|
||||
type Input = [Int]
|
||||
|
||||
type Parser = Parsec Void String
|
||||
|
||||
parseBlockSize :: Parser Int
|
||||
parseBlockSize = read . pure <$> digitChar
|
||||
|
||||
parseInput' :: Parser Input
|
||||
parseInput' = some parseBlockSize <* eol <* 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'
|
||||
|
||||
type Disk = V.Vector (Maybe Int) -- Maybe fileId
|
||||
type File = (Int, Int, Int) -- fileId, fileIndex, fileSize
|
||||
type Free = (Int, Int) -- index, size
|
||||
|
||||
compute :: Input -> Int
|
||||
compute input = V.sum $ V.imap checksum defragmentedDisk
|
||||
where
|
||||
checksum _ Nothing = 0
|
||||
checksum i (Just n) = i * n
|
||||
defragmentedDisk :: Disk
|
||||
(_, defragmentedDisk) = L.foldr defragment (frees, startingDisk) files
|
||||
startingDisk :: Disk
|
||||
startingDisk = V.replicate (sum input) Nothing
|
||||
(files, frees, _, _) = computeFileIndexAndSize input ([], [], 0, 0)
|
||||
computeFileIndexAndSize :: Input -> ([File], [Free], Int, Int) -> ([File], [Free], Int, Int)
|
||||
computeFileIndexAndSize [] acc = acc
|
||||
computeFileIndexAndSize (fileSize:[]) (files, frees, fileId, fileIndex) = (files ++ [(fileId, fileIndex, fileSize)], frees, 0, 0)
|
||||
computeFileIndexAndSize (fileSize:freeSize:fs) (files, frees, fileId, fileIndex) = computeFileIndexAndSize fs
|
||||
( files ++ [(fileId, fileIndex, fileSize)]
|
||||
, frees ++ [(fileIndex + fileSize, freeSize)]
|
||||
, fileId + 1
|
||||
, fileIndex + fileSize + freeSize )
|
||||
defragment :: File -> ([Free], Disk) -> ([Free], Disk)
|
||||
defragment (fileId, fileIndex, fileSize) (frees, disk) = (frees', disk V.// [(i, Just fileId)|i<-[fileIndex'..fileIndex'+fileSize-1]])
|
||||
where
|
||||
(fileIndex', frees') = findHole frees []
|
||||
findHole :: [Free] -> [Free] -> (Int, [Free])
|
||||
findHole [] _ = (fileIndex, frees)
|
||||
findHole (f@(freeIndex, freeSize):fs) acc | freeIndex > fileIndex = (fileIndex, frees)
|
||||
| freeSize == fileSize = (freeIndex, acc ++ fs)
|
||||
| freeSize > fileSize = (freeIndex, acc ++ ((freeIndex + fileSize, freeSize - fileSize):fs))
|
||||
| freeSize < fileSize = findHole fs (acc ++ [f])
|
||||
|
||||
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
|
Loading…
Add table
Reference in a new issue