package fr.triozer.aoc.y2022

import fr.triozer.aoc.utils.readInput

// #region part1
private fun part1(input: List<String>) = input.indices.sumOf { i ->
    input[0].indices.count { j ->
        val left = (j - 1 downTo 0).map { i to it }
        val right = (j + 1 until input[0].length).map { i to it }
        val up = (i - 1 downTo 0).map { it to j }
        val down = (i + 1 until input.size).map { it to j }

        listOf(left, right, up, down).any { trees ->
            trees.all { (x, y) -> input[x][y] < input[i][j] }
        }
    }
}
// #endregion part1

// #region part2
private fun part2(input: List<String>) = input.indices.maxOf { i ->
    input[0].indices.maxOf { j ->
        val left = (j - 1 downTo 0).map { i to it }
        val right = (j + 1 until input[0].length).map { i to it }
        val up = (i - 1 downTo 0).map { it to j }
        val down = (i + 1 until input.size).map { it to j }

        listOf(left, right, up, down).map { trees ->
            minOf(trees.takeWhile { (x, y) -> input[x][y] < input[i][j] }.size + 1, trees.size)
        }.reduce(Int::times)
    }
}
// #endregion part2

private fun main() {
    val testInput = readInput(2022, 8, "test")
    check(part1(testInput) == 21)
    check(part2(testInput) == 8)

    println("Checks passed ✅")

    val input = readInput(2022, 8, "input")
    println(part1(input))
    println(part2(input))
}

package fr.triozer.aoc.y2022

import fr.triozer.aoc.utils.readInput

// #region part1
private fun part1(input: List<String>) = input.indices.sumOf { i ->
    input[0].indices.count { j ->
        val left = (j - 1 downTo 0).map { i to it }
        val right = (j + 1 until input[0].length).map { i to it }
        val up = (i - 1 downTo 0).map { it to j }
        val down = (i + 1 until input.size).map { it to j }

        listOf(left, right, up, down).any { trees ->
            trees.all { (x, y) -> input[x][y] < input[i][j] }
        }
    }
}
// #endregion part1

// #region part2
private fun part2(input: List<String>) = input.indices.maxOf { i ->
    input[0].indices.maxOf { j ->
        val left = (j - 1 downTo 0).map { i to it }
        val right = (j + 1 until input[0].length).map { i to it }
        val up = (i - 1 downTo 0).map { it to j }
        val down = (i + 1 until input.size).map { it to j }

        listOf(left, right, up, down).map { trees ->
            minOf(trees.takeWhile { (x, y) -> input[x][y] < input[i][j] }.size + 1, trees.size)
        }.reduce(Int::times)
    }
}
// #endregion part2

private fun main() {
    val testInput = readInput(2022, 8, "test")
    check(part1(testInput) == 21)
    check(part2(testInput) == 8)

    println("Checks passed ✅")

    val input = readInput(2022, 8, "input")
    println(part1(input))
    println(part2(input))
}
