c/aoc-2024
1
Fork 0
Code Issues Releases Activity

Day 11 (Make fast when hot)

Browse Source
This commit is contained in:
Christian
2024-12-15 12:31:08 +01:00
parent 10d9d3452f
commit 7bd424d1f9
1 changed files with 17 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
aoc/src/dev/ctsk/aoc/days/Day11.scala
View File

@@ -11,28 +11,26 @@ object Day11 extends Solver(11):
val mod = Math.pow(10, numDigits / 2).toLong
Some(n % mod, n / mod)
private def count(initial: Seq[Long], depth: Int): Long =
def step(stones: MuMap[Long, Long]): MuMap[Long, Long] =
val next = MuMap.empty[Long, Long].withDefaultValue(0L)
for ((stone, count) <- stones) {
if stone == 0 then next(1) += count
private val memo = MuMap.empty[(Long, Int), Long]
private def count(initial: Long, numBlinks: Int): Long =
def rec(stone: Long, blinks: Int): Long =
if blinks == 0 then return 1L
memo.getOrElseUpdate(
(stone, blinks), {
if stone == 0 then rec(1L, blinks - 1)
else
halves(stone) match
case Some((a, b)) =>
next(a) += count
next(b) += count
case None =>
next(stone * 2024) += count
case Some(a, b) =>
rec(a, blinks - 1) + rec(b, blinks - 1)
case None => rec(stone * 2024, blinks - 1)
}
next
val initMap = MuMap.from(initial.map((_, 1L)))
Seq.iterate(initMap, depth + 1)(step).last.values.sum
)
rec(initial, numBlinks)
def run(input: os.ReadablePath): (Timings, Solution) =
val (pre_time, in) = timed { longs(os.read.lines(input).head) }
val (p1_time, p1_solution) = timed { count(in, 25) }
val (p2_time, p2_solution) = timed { count(in, 75) }
val (p1_time, p1_solution) = timed { in.map(v => count(v, 25)).sum }
val (p2_time, p2_solution) = timed { in.map(v => count(v, 75)).sum }
(
Timings(pre_time, p1_time, p2_time),