/
day2.scala
58 lines (48 loc) · 1.71 KB
/
day2.scala
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package aoc2023.day2
/*
* <https://adventofcode.com/2023/day/2>
*/
case class GameSet(red: Int, green: Int, blue: Int):
def subsetOf(other: GameSet): Boolean =
red <= other.red && green <= other.green && blue <= other.blue
def power =
red * green * blue
case class Game(id: Int, sets: List[GameSet]):
def minimum = GameSet(
red = sets.map(_.red).max,
green = sets.map(_.green).max,
blue = sets.map(_.blue).max
)
@main def run: Unit =
val initialBag = GameSet(red = 12, green = 13, blue = 14)
val ExtractGame = """^Game\s+(\d+)[:]([^$]+)$""".r
val ExtractCount = """^\s*(\d+)\s+(red|green|blue)\s*$""".r
val games = io.Source.fromResource("day2.txt").getLines
.collect:
case ExtractGame(id, setsStr) =>
val sets = setsStr
.split("\\s*;\\s*")
.map: gameSet =>
val map = gameSet.split("\\s*,\\s*")
.map:
case ExtractCount(nr, color) => (color, nr.toInt)
.toMap
GameSet(
red = map.getOrElse("red", 0),
green = map.getOrElse("green", 0),
blue = map.getOrElse("blue", 0)
)
.toList
Game(id.toInt, sets)
.toList
val part1 = games
.map: game =>
if game.sets.forall(_ subsetOf initialBag)
then game.id
else 0
.sum
val part2 =
games.map(_.minimum.power).sum
println("\nDay 2\n------------")
println(s"Part 1: $part1")
println(s"Part 2: $part2\n")