sln_2022_20

Copyright	(c) Eric Mertens 2022
License	ISC
Maintainer	emertens@gmail.com
Safe Haskell	None
Language	Haskell2010

Main

Description

https://adventofcode.com/2022/day/20

>>> :main + "1\n2\n-3\n3\n-2\n0\n4\n"
3
1623178306

Synopsis

main :: IO ()
solve :: Int -> [Int] -> IO Int
data Ring = Ring {
- ringSize :: !Int
- fwdLinks :: !(IOUArray Int Int)
- bwdLinks :: !(IOUArray Int Int)
}
newRing :: Int -> IO Ring
removeRing :: Int -> Ring -> IO Int
insertBeforeRing :: Int -> Int -> Ring -> IO ()
walk :: Int -> Int -> Ring -> IO Int

Documentation

main :: IO () Source #

>>> :main
1591
14579387544492

solve :: Int -> [Int] -> IO Int Source #

data Ring Source #

Constructors

Ring
Fields ringSize :: !Int fwdLinks :: !(IOUArray Int Int) forward links bwdLinks :: !(IOUArray Int Int) backward links

newRing Source #

Arguments

:: Int	size
-> IO Ring

Build a new circular ring of given size

removeRing Source #

Arguments

:: Int	node to remove from ring
-> Ring	ring
-> IO Int	index after removed node

Remove a node from the ring and return the index of the node before/after it.

insertBeforeRing Source #

Arguments

:: Int	node to insert
-> Int	node to insert before
-> Ring	ring
-> IO ()

Arguments

:: Int	step count (positive for forward, negative for backward)
-> Int	starting index
-> Ring	ring
-> IO Int	ending index