package net.olegg.aoc.year2017.day24

import net.olegg.aoc.someday.SomeDay
import net.olegg.aoc.year2017.DayOf2017
import java.util.BitSet
import kotlin.math.max

/**
 * See [Year 2017, Day 24](https://adventofcode.com/2017/day/24)
 */
object Day24 : DayOf2017(24) {
  override fun first(): Any? {
    val ports = lines
      .map { line -> line.split("/").mapNotNull { it.toIntOrNull() } }
      .mapIndexed { index, value ->
        Triple(value.min(), value.max(), index)
      }

    var best = 0
    val start = ports
      .filter { it.first == 0 || it.second == 0 }
      .map { port ->
        val next = if (port.first == 0) port.second else port.first
        return@map Triple(next, next, BitSet(ports.size).also { it.set(port.third) })
      }
    val queue = ArrayDeque(start)

    val visited = queue.map { it.first to it.third }.toMutableSet()

    while (queue.isNotEmpty()) {
      val curr = queue.removeFirst()
      best = max(best, curr.second)
      ports
        .filter { !curr.third[it.third] }
        .filter { it.first == curr.first || it.second == curr.first }
        .map { port ->
          val next = if (port.first == curr.first) port.second else port.first
          Triple(
            next,
            curr.second + port.first + port.second,
            BitSet(ports.size).also { it.or(curr.third) }.also { it.set(port.third) },
          )
        }
        .filterNot { (it.first to it.third) in visited }
        .forEach { port ->
          visited.add(port.first to port.third)
          queue.add(port)
        }
    }

    return best
  }

  override fun second(): Any? {
    val ports = lines
      .map { line -> line.split("/").mapNotNull { it.toIntOrNull() } }
      .mapIndexed { index, value ->
        Triple(value.min(), value.max(), index)
      }

    val start = ports
      .filter { it.first == 0 || it.second == 0 }
      .map { port ->
        val next = if (port.first == 0) port.second else port.first
        return@map Triple(next, (2 to next), BitSet(ports.size).also { it.set(port.third) })
      }
    val queue = ArrayDeque(start)

    val visited = queue.map { it.first to it.third }.toMutableSet()
    var best = 0 to 0

    while (queue.isNotEmpty()) {
      val curr = queue.removeFirst()
      best = maxOf(best, curr.second, compareBy({ it.first }, { it.second }))
      ports.filter { !curr.third[it.third] }
        .filter { it.first == curr.first || it.second == curr.first }
        .map { port ->
          val next = if (port.first == curr.first) port.second else port.first
          Triple(
            next,
            (curr.second.first + 1 to curr.second.second + port.first + port.second),
            BitSet(ports.size).also { it.or(curr.third) }.also { it.set(port.third) },
          )
        }
        .filterNot { (it.first to it.third) in visited }
        .forEach { port ->
          visited.add(port.first to port.third)
          queue.addLast(port)
        }
    }

    return best.second
  }
}

fun main() = SomeDay.mainify(Day24)

package net.olegg.aoc.year2017.day24

import net.olegg.aoc.someday.SomeDay
import net.olegg.aoc.year2017.DayOf2017
import java.util.BitSet
import kotlin.math.max

/**
 * See [Year 2017, Day 24](https://adventofcode.com/2017/day/24)
 */
object Day24 : DayOf2017(24) {
  override fun first(): Any? {
    val ports = lines
      .map { line -> line.split("/").mapNotNull { it.toIntOrNull() } }
      .mapIndexed { index, value ->
        Triple(value.min(), value.max(), index)
      }

    var best = 0
    val start = ports
      .filter { it.first == 0 || it.second == 0 }
      .map { port ->
        val next = if (port.first == 0) port.second else port.first
        return@map Triple(next, next, BitSet(ports.size).also { it.set(port.third) })
      }
    val queue = ArrayDeque(start)

    val visited = queue.map { it.first to it.third }.toMutableSet()

    while (queue.isNotEmpty()) {
      val curr = queue.removeFirst()
      best = max(best, curr.second)
      ports
        .filter { !curr.third[it.third] }
        .filter { it.first == curr.first || it.second == curr.first }
        .map { port ->
          val next = if (port.first == curr.first) port.second else port.first
          Triple(
            next,
            curr.second + port.first + port.second,
            BitSet(ports.size).also { it.or(curr.third) }.also { it.set(port.third) },
          )
        }
        .filterNot { (it.first to it.third) in visited }
        .forEach { port ->
          visited.add(port.first to port.third)
          queue.add(port)
        }
    }

    return best
  }

  override fun second(): Any? {
    val ports = lines
      .map { line -> line.split("/").mapNotNull { it.toIntOrNull() } }
      .mapIndexed { index, value ->
        Triple(value.min(), value.max(), index)
      }

    val start = ports
      .filter { it.first == 0 || it.second == 0 }
      .map { port ->
        val next = if (port.first == 0) port.second else port.first
        return@map Triple(next, (2 to next), BitSet(ports.size).also { it.set(port.third) })
      }
    val queue = ArrayDeque(start)

    val visited = queue.map { it.first to it.third }.toMutableSet()
    var best = 0 to 0

    while (queue.isNotEmpty()) {
      val curr = queue.removeFirst()
      best = maxOf(best, curr.second, compareBy({ it.first }, { it.second }))
      ports.filter { !curr.third[it.third] }
        .filter { it.first == curr.first || it.second == curr.first }
        .map { port ->
          val next = if (port.first == curr.first) port.second else port.first
          Triple(
            next,
            (curr.second.first + 1 to curr.second.second + port.first + port.second),
            BitSet(ports.size).also { it.or(curr.third) }.also { it.set(port.third) },
          )
        }
        .filterNot { (it.first to it.third) in visited }
        .forEach { port ->
          visited.add(port.first to port.third)
          queue.addLast(port)
        }
    }

    return best.second
  }
}

fun main() = SomeDay.mainify(Day24)
