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
69
70
71
72
73
74
75
76
77
78
79
80
81
|
--- Part Two ---
Now, discard the corrupted lines. The remaining lines are [1m[37mincomplete[0m.
Incomplete lines don't have any incorrect characters - instead, they're missing some closing
characters at the end of the line. To repair the navigation subsystem, you just need to figure out
[1m[37mthe sequence of closing characters[0m that complete all open chunks in the line.
You can only use closing characters (), ], }, or >), and you must add them in the correct order so
that only legal pairs are formed and all chunks end up closed.
In the example above, there are five incomplete lines:
- [({(<(())[]>[[{[]{<()<>> - Complete by adding }}]])})].
- [(()[<>])]({[<{<<[]>>( - Complete by adding )}>]}).
- (((({<>}<{<{<>}{[]{[]{} - Complete by adding }}>}>)))).
- {<[[]]>}<{[{[{[]{()[[[] - Complete by adding ]]}}]}]}>.
- <{([{{}}[<[[[<>{}]]]>[]] - Complete by adding ])}>.
Did you know that autocomplete tools [1m[37malso[0m have contests? It's true! The score is determined by
considering the completion string character-by-character. Start with a total score of 0. Then, for
each character, multiply the total score by 5 and then increase the total score by the point value
given for the character in the following table:
- ): 1 point.
- ]: 2 points.
- }: 3 points.
- >: 4 points.
So, the last completion string above - ])}> - would be scored as follows:
- Start with a total score of 0.
- Multiply the total score by 5 to get 0, then add the value of ] (2) to get a new total score of
2.
- Multiply the total score by 5 to get 10, then add the value of ) (1) to get a new total score of
11.
- Multiply the total score by 5 to get 55, then add the value of } (3) to get a new total score of
58.
- Multiply the total score by 5 to get 290, then add the value of > (4) to get a new total score of
294.
The five lines' completion strings have total scores as follows:
- }}]])})] - 288957 total points.
- )}>]}) - 5566 total points.
- }}>}>)))) - 1480781 total points.
- ]]}}]}]}> - 995444 total points.
- ])}> - 294 total points.
Autocomplete tools are an odd bunch: the winner is found by [1m[37msorting[0m all of the scores and then
taking the [1m[37mmiddle[0m score. (There will always be an odd number of scores to consider.) In this
example, the middle score is [1m[37m288957[0m because there are the same number of scores smaller and larger
than it.
Find the completion string for each incomplete line, score the completion strings, and sort the
scores. [1m[37mWhat is the middle score?[0m
|
