advent-of-code/2018/13/main.kt

96 lines
3.0 KiB
Kotlin

package aoc.thirteen
import aoc.thirteen.Field
import aoc.thirteen.Turn
import aoc.thirteen.Train
import java.io.File
import java.io.InputStream
class Main() {
companion object {
public var field: MutableList<MutableList<Field>> = mutableListOf<MutableList<Field>>()
fun parseField(c: Char): Field {
return when (c) {
'|', 'v', '^' -> Field.VERTICAL
'-', '>', '<' -> Field.HORIZONTAL
'/' -> Field.TOP_LEFT
'\\' -> Field.TOP_RIGHT
'+' -> Field.INTERSECTION
' ' -> Field.EMPTY
else -> throw IllegalArgumentException("can’t parse field " + c)
}
}
fun findCrash(trains: MutableList<Train>) {
var positions = HashSet<Pair<Int, Int>>(trains.size - 1)
trains.map{ t -> Pair(t.x, t.y) }.forEach{ p ->
if (p !in positions) positions.add(p)
else println(p)
}
}
fun parseTrain(c: Char, x: Int, y: Int): Train {
val dir = when (c) {
'^' -> 0
'>' -> 1
'v' -> 2
'<' -> 3
else -> throw IllegalArgumentException("this shouldn’t happen rooDerp")
}
return Train(dir, x, y)
}
fun moveTrain(t: Train): Train {
when (t.direction) {
0 -> t.y -= 1
1 -> t.x += 1
2 -> t.y += 1
3 -> t.x -= 1
else -> throw IllegalArgumentException("this shouldn’t happen either selphyDerp")
}
val current = field[t.y][t.x]
when (current) {
Field.VERTICAL, Field.HORIZONTAL -> {}
Field.TOP_LEFT -> t.direction = t.direction xor 1
Field.TOP_RIGHT -> t.direction = t.direction xor 3
Field.INTERSECTION -> t.crossIntersection()
Field.EMPTY -> throw IllegalStateException("I shouldn’t be here")
}
return t
}
@JvmStatic
fun main(args: Array<String>) {
val inputStream = File("input").inputStream()
val inputLines = inputStream.bufferedReader().use { it.readText() }.split("\n")
val TRAINS = charArrayOf('<', '>', '^', 'v')
var trains = mutableListOf<Train>()
for ((y, line) in inputLines.withIndex()) {
var fields = mutableListOf<Field>()
for ((x, char) in line.toCharArray().withIndex()) {
if (char in TRAINS) {
val newTrain = parseTrain(char, x, y)
trains.add(newTrain)
}
fields.add(parseField(char))
}
field.add(fields)
}
var positions = HashSet<Pair<Int, Int>>(trains.size)
positions.addAll(trains.map{ t -> Pair(t.x, t.y) })
var current = 0
while (positions.size == trains.size) {
trains[current] = moveTrain(trains[current])
positions.clear()
positions.addAll(trains.map{ t -> Pair(t.x, t.y) })
current = (current + 1) % trains.size
}
findCrash(trains)
}
}
}