43 lines
1.3 KiB
Haskell
43 lines
1.3 KiB
Haskell
import Data.Foldable
|
|
import Data.HashMap
|
|
import Data.Sequence
|
|
|
|
type Bank = Seq Int
|
|
type HashableBank = [Int]
|
|
type Config = (Bank, Data.HashMap.Map HashableBank Int)
|
|
|
|
(%) :: Int -> Int -> Int
|
|
(%) = mod
|
|
|
|
(//) :: Int -> Int -> Int
|
|
(//) = div
|
|
|
|
getMaxMem :: Bank -> (Int, Int)
|
|
getMaxMem bank =
|
|
foldlWithIndex (\(currIndex, currMax) index value -> if value > currMax then (index, value) else (currIndex, currMax)) (0, 0) bank
|
|
|
|
nextBank :: Bank -> Bank
|
|
nextBank bank =
|
|
let len = Data.Sequence.length bank
|
|
(index, value) = getMaxMem bank
|
|
zeroedBank = Data.Sequence.update index 0 bank
|
|
mappedBank = fmap (+ value // len) zeroedBank
|
|
indicesToUpdate = fmap ((% len) . (+ index)) [1..value % len]
|
|
in mapWithIndex (\i v -> if i `elem` indicesToUpdate then v + 1 else v) mappedBank
|
|
|
|
|
|
cycles :: Int -> Config -> (Int, Int)
|
|
cycles prevCount (prevBank, banks) =
|
|
let count = prevCount + 1
|
|
bank = nextBank prevBank
|
|
hashableBank = Data.Foldable.toList bank
|
|
in if member hashableBank banks
|
|
then (count, count - findWithDefault undefined hashableBank banks)
|
|
else cycles count (bank, insert hashableBank count banks)
|
|
|
|
main :: IO ()
|
|
main = do
|
|
input <- readFile "6.txt"
|
|
let bank = Data.Sequence.fromList $ fmap read $ words input :: Bank
|
|
print $ cycles 0 (bank, Data.HashMap.empty)
|