-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay10SyntaxScoring.kt
68 lines (56 loc) · 1.85 KB
/
Day10SyntaxScoring.kt
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
59
60
61
62
63
64
65
66
67
68
package adventofcode.year2021
import adventofcode.Puzzle
import adventofcode.PuzzleInput
class Day10SyntaxScoring(customInput: PuzzleInput? = null) : Puzzle(customInput) {
private val lines by lazy { input.lines() }
private val bracketMap =
mapOf(
'(' to ')',
'[' to ']',
'{' to '}',
'<' to '>',
)
private val scoreMapPartOne =
mapOf(
')' to 3,
']' to 57,
'}' to 1197,
'>' to 25137,
)
private val scoreMapPartTwo =
mapOf(
')' to 1,
']' to 2,
'}' to 3,
'>' to 4,
)
private fun List<Any>.middle() = this[size / 2]
override fun partOne() =
lines
.mapNotNull { line ->
val stack = ArrayDeque<Char>()
line.forEach { char ->
when (char) {
in setOf('(', '[', '{', '<') -> stack.add(char)
else -> if (char != bracketMap[stack.removeLast()]) return@mapNotNull char
}
}
null
}
.sumOf { char -> scoreMapPartOne[char]!! }
override fun partTwo() =
lines
.mapNotNull { line ->
val stack = ArrayDeque<Char>()
line.forEach { char ->
when (char) {
in setOf('(', '[', '{', '<') -> stack.add(char)
else -> if (char != bracketMap[stack.removeLast()]) return@mapNotNull null
}
}
stack.reversed().map { openingBracket -> bracketMap[openingBracket]!! }
}
.map { completion -> completion.fold(0L) { acc, char -> acc * 5 + scoreMapPartTwo[char]!! } }
.sorted()
.middle()
}