day(15): move Dijkstra to separate class
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
parent
acf453d45e
commit
6b17fef240
1 changed files with 83 additions and 96 deletions
|
|
@ -3,39 +3,52 @@ package year2021.day15
|
|||
import readInput
|
||||
import java.util.*
|
||||
|
||||
fun validAdjacentIndices(input: List<List<Int>>, y0: Int, x0: Int): Iterable<Pair<Int, Int>> =
|
||||
(y0 - 1..y0 + 1)
|
||||
.flatMap { y -> (x0 - 1..x0 + 1).map { x -> Pair(y, x) } }
|
||||
.filter { (y, x) ->
|
||||
(y != y0 || x != x0) && (y == y0 || x == x0) && (y >= 0 && y < input.size) && (x >= 0 && x < input[y].size)
|
||||
data class Coordinate(val y: Int, val x: Int) {
|
||||
fun adjacent(): Iterable<Coordinate> =
|
||||
listOf(
|
||||
Coordinate(y - 1, x),
|
||||
Coordinate(y + 1, x),
|
||||
Coordinate(y, x + 1),
|
||||
Coordinate(y, x - 1)
|
||||
)
|
||||
}
|
||||
|
||||
fun validAdjacentIndicesExtended(input: List<List<Int>>, y0: Int, x0: Int): Iterable<Pair<Int, Int>> =
|
||||
(y0 - 1..y0 + 1)
|
||||
.flatMap { y -> (x0 - 1..x0 + 1).map { x -> Pair(y, x) } }
|
||||
.filter { (y, x) ->
|
||||
(y != y0 || x != x0) && (y == y0 || x == x0) && (y >= 0 && y < 5 * input.size) && (x >= 0 && x < 5 * input[0].size)
|
||||
}
|
||||
|
||||
data class Coordinate(val y: Int, val x: Int)
|
||||
|
||||
fun part1(input: List<List<Int>>): Int {
|
||||
val final = Coordinate(input.size - 1, input.last().size - 1)
|
||||
|
||||
val queue = PriorityQueue<Pair<Int, Coordinate>>() { a, b ->
|
||||
open class Dijkstra(
|
||||
private val input: List<List<Int>>
|
||||
) {
|
||||
private val queue: PriorityQueue<Pair<Int, Coordinate>> =
|
||||
PriorityQueue<Pair<Int, Coordinate>> { a, b ->
|
||||
a.first - b.first
|
||||
}
|
||||
val distances = mutableMapOf<Coordinate, Int>()
|
||||
val processed = mutableSetOf<Coordinate>()
|
||||
private val distances = mutableMapOf<Coordinate, Int>()
|
||||
private val processed = mutableSetOf<Coordinate>()
|
||||
|
||||
queue.add(Pair(0, Coordinate(0, 0)))
|
||||
distances[Coordinate(0, 0)] = 0
|
||||
for (y in input.indices) {
|
||||
for (x in input[y].indices) {
|
||||
queue.add(Pair(Int.MAX_VALUE, Coordinate(y, x)))
|
||||
fun getDistance(coordinate: Coordinate): Int =
|
||||
distances[coordinate] ?: Int.MAX_VALUE
|
||||
|
||||
open fun getCost(coordinate: Coordinate): Int =
|
||||
input[coordinate.y][coordinate.x]
|
||||
|
||||
private fun relax(distance: Int, neighbour: Coordinate): Boolean {
|
||||
val alternative = distance + getCost(neighbour)
|
||||
if (alternative >= getDistance(neighbour)) {
|
||||
return false
|
||||
}
|
||||
|
||||
distances[neighbour] = alternative
|
||||
queue.add(Pair(alternative, neighbour))
|
||||
return true
|
||||
}
|
||||
|
||||
open fun neighbours(coordinate: Coordinate): Iterable<Coordinate> =
|
||||
coordinate.adjacent().filter { (y, x) ->
|
||||
(y >= 0 && y < input.size) && (x >= 0 && x < input[y].size)
|
||||
}
|
||||
|
||||
fun run(start: Coordinate, end: Coordinate): Dijkstra {
|
||||
queue.add(Pair(0, start))
|
||||
distances[start] = 0
|
||||
|
||||
while (queue.isNotEmpty()) {
|
||||
val (distance, coordinate) = queue.remove()!!
|
||||
if (processed.contains(coordinate)) {
|
||||
|
|
@ -43,75 +56,49 @@ fun part1(input: List<List<Int>>): Int {
|
|||
}
|
||||
processed.add(coordinate)
|
||||
|
||||
if (coordinate == final) {
|
||||
return distance
|
||||
if (coordinate == end) {
|
||||
return this
|
||||
}
|
||||
|
||||
for ((y, x) in validAdjacentIndices(input, coordinate.y, coordinate.x)) {
|
||||
val neighbour = Coordinate(y, x)
|
||||
val alternative = distance + input[y][x]
|
||||
|
||||
if (alternative < (distances[neighbour] ?: Int.MAX_VALUE)) {
|
||||
distances[neighbour] = alternative
|
||||
queue.add(Pair(alternative, neighbour))
|
||||
}
|
||||
}
|
||||
}
|
||||
return Int.MAX_VALUE
|
||||
neighbours(coordinate).forEach { relax(distance, it) }
|
||||
}
|
||||
|
||||
fun getDistance(input: List<List<Int>>, y: Int, x: Int): Int {
|
||||
val riskLevel = input[y % input.size][x % input[0].size]
|
||||
return this
|
||||
}
|
||||
}
|
||||
|
||||
fun part1(input: List<List<Int>>): Int =
|
||||
Coordinate(input.size - 1, input.last().size - 1).let { end ->
|
||||
Dijkstra(input)
|
||||
.run(
|
||||
Coordinate(0, 0),
|
||||
end
|
||||
).getDistance(end)
|
||||
}
|
||||
|
||||
class DijkstraOnExtended(private val input: List<List<Int>>) : Dijkstra(input) {
|
||||
override fun neighbours(coordinate: Coordinate): Iterable<Coordinate> =
|
||||
coordinate.adjacent().filter { (y, x) ->
|
||||
(y >= 0 && y < 5 * input.size) && (x >= 0 && x < 5 * input[0].size)
|
||||
}
|
||||
|
||||
override fun getCost(coordinate: Coordinate): Int {
|
||||
val (y, x) = coordinate
|
||||
|
||||
val added = y / input.size + x / input[0].size
|
||||
val riskLevel = input[y % input.size][x % input[0].size] + added
|
||||
|
||||
if (riskLevel + added > 9) {
|
||||
return riskLevel + added - 9
|
||||
}
|
||||
|
||||
return riskLevel + added
|
||||
}
|
||||
|
||||
fun part2(input: List<List<Int>>): Int {
|
||||
val final = Coordinate(5 * input.size - 1, 5 * input.last().size - 1)
|
||||
|
||||
val queue = PriorityQueue<Pair<Int, Coordinate>>() { a, b ->
|
||||
a.first - b.first
|
||||
}
|
||||
val distances = mutableMapOf<Coordinate, Int>()
|
||||
val processed = mutableSetOf<Coordinate>()
|
||||
|
||||
queue.add(Pair(0, Coordinate(0, 0)))
|
||||
distances[Coordinate(0, 0)] = 0
|
||||
for (y in input.indices) {
|
||||
for (x in input[y].indices) {
|
||||
for (i in 0 until 5) {
|
||||
queue.add(Pair(Int.MAX_VALUE, Coordinate(i * y, i * x)))
|
||||
}
|
||||
return if (riskLevel > 9) riskLevel - 9 else riskLevel
|
||||
}
|
||||
}
|
||||
|
||||
while (queue.isNotEmpty()) {
|
||||
val (distance, coordinate) = queue.remove()!!
|
||||
if (processed.contains(coordinate)) {
|
||||
continue
|
||||
}
|
||||
processed.add(coordinate)
|
||||
|
||||
if (coordinate == final) {
|
||||
return distance
|
||||
}
|
||||
|
||||
for ((y, x) in validAdjacentIndicesExtended(input, coordinate.y, coordinate.x)) {
|
||||
val neighbour = Coordinate(y, x)
|
||||
val alternative = distance + getDistance(input, y, x)
|
||||
|
||||
if (alternative < (distances[neighbour] ?: Int.MAX_VALUE)) {
|
||||
distances[neighbour] = alternative
|
||||
queue.add(Pair(alternative, neighbour))
|
||||
}
|
||||
}
|
||||
}
|
||||
return Int.MAX_VALUE
|
||||
fun part2(input: List<List<Int>>): Int =
|
||||
Coordinate(5 * input.size - 1, 5 * input.last().size - 1).let { end ->
|
||||
DijkstraOnExtended(input)
|
||||
.run(
|
||||
Coordinate(0, 0),
|
||||
end
|
||||
).getDistance(end)
|
||||
}
|
||||
|
||||
fun main() {
|
||||
|
|
|
|||
Loading…
Reference in a new issue