docs(2023): add day 19 part 2

believer · Dec 19, 2023 · a3e8407 · a3e8407
1 parent 15cb8c1
commit a3e8407
Show file tree

Hide file tree

Showing 2 changed files with 9 additions and 3 deletions.
diff --git a/rust/2023/README.md b/rust/2023/README.md
@@ -34,7 +34,7 @@ You try to ask why they can't just use a weather machine ("not powerful enough")
 | [Day 16: The Floor Will Be Lava](https://github.com/believer/advent-of-code/blob/master/rust/2023/src/day_16.rs)         | 🌟  |       7562 | 🌟  |            7793 |
 | [Day 17: Clumsy Crucible](https://github.com/believer/advent-of-code/blob/master/rust/2023/src/day_17.rs)                | 🌟  |       1013 | 🌟  |            1215 |
 | [Day 18: Lavaduct Lagoon](https://github.com/believer/advent-of-code/blob/master/rust/2023/src/day_18.rs)                | 🌟  |      48652 | 🌟  |  45757884535661 |
-| [Day 19: Aplenty](https://github.com/believer/advent-of-code/blob/master/rust/2023/src/day_19.rs)                        | 🌟  |     331208 |     |                 |
+| [Day 19: Aplenty](https://github.com/believer/advent-of-code/blob/master/rust/2023/src/day_19.rs)                        | 🌟  |     331208 | 🌟  | 121464316215623 |
 
 ## Performance
 
@@ -60,7 +60,7 @@ With the help of [cargo-aoc](https://github.com/gobanos/cargo-aoc) I get automat
 | 16  |   1.41 ms |      49.39 ms |                       |              30.33 µs |
 | 17  |  64.21 ms |     173.37 ms |                       |              47.36 µs |
 | 18  | 837.59 ns |     844.43 ns |                       |   41.30 µs / 73.29 µs |
-| 19  |  55.27 µs |             - |                       |             213.26 µs |
+| 19  |  55.27 µs |     160.90 µs |                       |             213.26 µs |
 
 \* compared to first solution<br/>
 \*\* slow, didn't benchmark. Value comes from running the solver.

diff --git a/rust/2023/src/day_19.rs b/rust/2023/src/day_19.rs
@@ -3,7 +3,13 @@
 //! The hard part about part 1 was getting the parsing done in a good and usable way.
 //! Otherwise, it's just a matter of following the rules until we get to A or R.
 //!
-//! Part 2 I don't really understand right now, might come back.
+//! Part 2 I didn't really understand at first. I even had a hard time understanding
+//! the solutions posted on Reddit. What made it click for me was HyperNeutrino's
+//! YouTube video on the problem. I highly recommend watching it if you're stuck.
+//! https://www.youtube.com/watch?v=3RwIpUegdU4
+//!
+//! It gave me explanations and code I could understand. I used his code as a help
+//! in debugging my code. What the states should look like after each rule and iteration.
 
 use std::collections::HashMap;