|
| 1 | +fun main() { |
| 2 | + println(solve20a(readInputLines("20"))) |
| 3 | + println(solve20b(readInputLines("20"))) |
| 4 | +} |
| 5 | + |
| 6 | +fun solve20a(lines: List<String>): Int = solve20ForDistance(lines, cheatingDistance = 2) |
| 7 | +fun solve20b(lines: List<String>): Int = solve20ForDistance(lines, cheatingDistance = 20) |
| 8 | + |
| 9 | +private fun solve20ForDistance(lines: List<String>, cheatingDistance: Int): Int { |
| 10 | + val (maze, start, end) = parseInput(lines) |
| 11 | + |
| 12 | + val scoresFromStart = getDistancesFromPoint(maze, start) |
| 13 | + val scoresFromEnd = getDistancesFromPoint(maze, end) |
| 14 | + val withoutCheating = checkNotNull(scoresFromStart[end]) |
| 15 | + |
| 16 | + var count = 0 |
| 17 | + for ((p, _) in maze.entries.filter { |
| 18 | + it.value is MazeEmpty && scoresFromStart.getOrDefault( |
| 19 | + it.key, Int.MAX_VALUE |
| 20 | + ) < withoutCheating |
| 21 | + }) { |
| 22 | + val fromStart = checkNotNull(scoresFromStart[p]) |
| 23 | + val availableFields = |
| 24 | + getPointsWithinDistance(maze, p, cheatingDistance).filter { maze[it] is MazeEmpty && it in scoresFromEnd } |
| 25 | + |
| 26 | + for (p2 in availableFields) { |
| 27 | + val total = fromStart + p2.distance(p) + checkNotNull(scoresFromEnd[p2]) |
| 28 | + |
| 29 | + if (withoutCheating - total >= 100) { |
| 30 | + count += 1 |
| 31 | + } |
| 32 | + } |
| 33 | + } |
| 34 | + |
| 35 | + return count |
| 36 | +} |
| 37 | + |
| 38 | +private data class Input20(val maze: Map<Point, MazeField>, val start: Point, val end: Point) |
| 39 | + |
| 40 | +private fun parseInput(lines: List<String>): Input20 { |
| 41 | + val map = mutableMapOf<Point, MazeField>() |
| 42 | + var start: Point? = null |
| 43 | + var end: Point? = null |
| 44 | + |
| 45 | + for ((y, line) in lines.withIndex()) { |
| 46 | + for ((x, c) in line.withIndex()) { |
| 47 | + val p = Point(x, y) |
| 48 | + if (c == 'E') { |
| 49 | + end = p |
| 50 | + } else if (c == 'S') { |
| 51 | + start = p |
| 52 | + } |
| 53 | + |
| 54 | + val field = if (c == '#') MazeWall else MazeEmpty |
| 55 | + map[p] = field |
| 56 | + } |
| 57 | + } |
| 58 | + |
| 59 | + return Input20(map, checkNotNull(start), checkNotNull(end)) |
| 60 | +} |
| 61 | + |
| 62 | +private fun getDistancesFromPoint(maze: Map<Point, MazeField>, start: Point): Map<Point, Int> { |
| 63 | + val visited = mutableSetOf(start) |
| 64 | + val dq = ArrayDeque<Pair<Point, Int>>() |
| 65 | + dq.addLast(Pair(start, 0)) |
| 66 | + val scores = mutableMapOf(Pair(start, 0)) |
| 67 | + |
| 68 | + while (dq.isNotEmpty()) { |
| 69 | + val (p, s) = dq.removeFirst() |
| 70 | + scores[p] = s |
| 71 | + |
| 72 | + for (d in Direction.values()) { |
| 73 | + val p2 = move(d, p) |
| 74 | + if (maze[p2] is MazeEmpty && p2 !in visited) { |
| 75 | + visited.add(p2) |
| 76 | + dq.addLast(Pair(p2, s + 1)) |
| 77 | + } |
| 78 | + } |
| 79 | + } |
| 80 | + |
| 81 | + return scores |
| 82 | +} |
| 83 | + |
| 84 | +fun getPointsWithinDistance(maze: Map<Point, MazeField>, start: Point, distance: Int): Set<Point> { |
| 85 | + val visited = mutableSetOf(start) |
| 86 | + val dq = ArrayDeque<Pair<Point, Int>>() |
| 87 | + dq.addLast(Pair(start, 0)) |
| 88 | + |
| 89 | + while (dq.isNotEmpty()) { |
| 90 | + val (p, s) = dq.removeFirst() |
| 91 | + |
| 92 | + if (s == distance) { |
| 93 | + continue |
| 94 | + } |
| 95 | + |
| 96 | + for (d in Direction.values()) { |
| 97 | + val p2 = move(d, p) |
| 98 | + if (p2 !in visited && p2 in maze) { |
| 99 | + visited.add(p2) |
| 100 | + dq.addLast(Pair(p2, s + 1)) |
| 101 | + } |
| 102 | + } |
| 103 | + } |
| 104 | + |
| 105 | + return visited - start |
| 106 | +} |
0 commit comments