dnutiu/aoc-2023
dnutiu/aoc-2023
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

🎄Advent of Code - Day 2 ✨ part 2

Browse source
This commit is contained in:
Denis-Cosmin Nutiu 2023-12-02 12:27:50 +02:00
parent c58688c25c
commit 9feaac9deb
2 changed files with 18 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

26
src/main/kotlin/AdventOfCode2023/day2/CubeConundrum.kt
View file

@ -38,7 +38,7 @@ class CubeConundrum : Puzzle {
var gamePossible = true
it.gameData?.forEach { gameData ->
val cubes = gameData.split(",")
cubes.forEach cubeForEach@ { cubeSet ->
cubes.forEach cubeForEach@{ cubeSet ->
val cubeData = cubeSet.trim().split(" ")
if (cubeData[0].toInt() > gameMaxConstraints.getOrDefault(cubeData[1], Int.MAX_VALUE)) {
gamePossible = false
@ -59,24 +59,26 @@ class CubeConundrum : Puzzle {
What is the sum of the power of these sets?
*/
val games = getGameList();
val sum = games.map {
var gamePower = 0
val gameMaxConstraints = mapOf(
"red" to 12,
"green" to 13,
"blue" to 14
var minimumPerGame = mutableMapOf(
"red" to 0,
"green" to 0,
"blue" to 0
)
games.forEach {
it.gameData?.forEach { gameData ->
val cubes = gameData.split(",")
cubes.forEach cubeForEach@ { cubeSet ->
cubes.forEach cubeForEach@{ cubeSet ->
val cubeData = cubeSet.trim().split(" ")
println()
minimumPerGame[cubeData[1]] =
Math.max(minimumPerGame[cubeData[1]]!!, cubeData[0].toInt())
}
}
gamePower = 0
}
println("The sum of the game ids is $gamePower.")
gamePower = minimumPerGame["red"]!! * minimumPerGame["green"]!! * minimumPerGame["blue"]!!
gamePower
}.sum()
println("The sum of the game power is $sum.")
}
}

4
src/main/kotlin/Main.kt
View file

@ -2,6 +2,6 @@ import AdventOfCode2023.day2.CubeConundrum
fun main(args: Array<String>) {
val t = CubeConundrum()
t.partOne()
// t.partTwo()
// t.partOne()
t.partTwo()
}