|
| 1 | +package de.ronny_h.aoc.year2025.day05 |
| 2 | + |
| 3 | +import de.ronny_h.aoc.AdventOfCode |
| 4 | +import de.ronny_h.aoc.extensions.collections.split |
| 5 | + |
| 6 | +fun main() = Cafeteria().run(885, 348115621205535) |
| 7 | + |
| 8 | +class Cafeteria : AdventOfCode<Long>(2025, 5) { |
| 9 | + override fun part1(input: List<String>): Long { |
| 10 | + with(input.parseIngredients()) { |
| 11 | + return available.count { it.isFresh(freshRanges) }.toLong() |
| 12 | + } |
| 13 | + } |
| 14 | + |
| 15 | + override fun part2(input: List<String>): Long = |
| 16 | + input.parseIngredients() |
| 17 | + .freshRanges |
| 18 | + .sortedBy { it.first } |
| 19 | + .fold(mutableListOf<LongRange>()) { compactRanges, range -> |
| 20 | + compactRanges.mergeRange(range) |
| 21 | + }.sumOf { |
| 22 | + it.last - it.first + 1 |
| 23 | + } |
| 24 | +} |
| 25 | + |
| 26 | +data class Ingredients(val freshRanges: List<LongRange>, val available: List<Long>) |
| 27 | + |
| 28 | +// invariant: ranges in this MutableList are non-overlapping and sorted |
| 29 | +// pre-condition: add operations only occur with ranges sorted by their first value |
| 30 | +fun MutableList<LongRange>.mergeRange(toAdd: LongRange): MutableList<LongRange> { |
| 31 | + if (none { toAdd.first in it || toAdd.last in it }) { |
| 32 | + // disjunct -> just add it |
| 33 | + add(toAdd) |
| 34 | + return this |
| 35 | + } |
| 36 | + for ((i, range) in withIndex()) { |
| 37 | + if (toAdd.first in range && toAdd.last in range) { |
| 38 | + // toAdd is completely contained in this range |
| 39 | + return this |
| 40 | + } |
| 41 | + if (toAdd.first !in range && toAdd.last !in range) { |
| 42 | + continue |
| 43 | + } |
| 44 | + |
| 45 | + val lastOverlappingRangeIndex = indexOfLast { toAdd.last in it } |
| 46 | + if (toAdd.first in range && lastOverlappingRangeIndex == -1) { |
| 47 | + // the beginning overlaps with this range -> merge |
| 48 | + this[i] = range.first..toAdd.last |
| 49 | + return this |
| 50 | + } |
| 51 | + |
| 52 | + // overlaps with several ranges -> squash them |
| 53 | + val lastOverlappingRange = this[lastOverlappingRangeIndex] |
| 54 | + for (index in lastOverlappingRangeIndex downTo i + 1) { |
| 55 | + this.removeAt(index) |
| 56 | + } |
| 57 | + this[i] = range.first..lastOverlappingRange.last |
| 58 | + return this |
| 59 | + } |
| 60 | + error("If this line is reached, a case is missing") |
| 61 | +} |
| 62 | + |
| 63 | +fun Long.isFresh(freshRanges: List<LongRange>): Boolean = freshRanges.any { this in it } |
| 64 | + |
| 65 | +fun List<String>.parseIngredients(): Ingredients { |
| 66 | + val (fresh, available) = split() |
| 67 | + return Ingredients( |
| 68 | + fresh.map { |
| 69 | + val (from, to) = it.split("-").map(String::toLong) |
| 70 | + from..to |
| 71 | + }, |
| 72 | + available.map { it.toLong() } |
| 73 | + ) |
| 74 | +} |
0 commit comments