diff options
| author | Sebastiano Tronto <sebastiano@tronto.net> | 2025-12-08 07:29:26 +0100 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano@tronto.net> | 2025-12-08 07:29:26 +0100 |
| commit | 5d69f923116a2b251a445c0cb9e6f23551ad686a (patch) | |
| tree | 42dfa409c6198f6796b4e8513d01bbdb0a00725e /2025/README.md | |
| parent | 01c2cd358b3f693181fa86e82414b3e32f9a890e (diff) | |
| download | aoc-5d69f923116a2b251a445c0cb9e6f23551ad686a.tar.gz aoc-5d69f923116a2b251a445c0cb9e6f23551ad686a.zip | |
Day 8 2025
Diffstat (limited to '2025/README.md')
| -rw-r--r-- | 2025/README.md | 12 |
1 files changed, 12 insertions, 0 deletions
diff --git a/2025/README.md b/2025/README.md index 4ca1d2e..19fbb29 100644 --- a/2025/README.md +++ b/2025/README.md | |||
| @@ -11,6 +11,7 @@ Example | |||
| 11 | 11 | ||
| 12 | ``` | 12 | ``` |
| 13 | Day -Part 1- -Part 2- | 13 | Day -Part 1- -Part 2- |
| 14 | 8 00:29:14 00:33:02 | ||
| 14 | 7 00:05:27 00:20:40 | 15 | 7 00:05:27 00:20:40 |
| 15 | 6 00:13:38 01:49:24 | 16 | 6 00:13:38 01:49:24 |
| 16 | 5 00:04:39 00:22:19 | 17 | 5 00:04:39 00:22:19 |
| @@ -100,3 +101,14 @@ end there from the previous row (that can be one or two tachyons). | |||
| 100 | I added a second solution for part 2 that does not use a map, but only | 101 | I added a second solution for part 2 that does not use a map, but only |
| 101 | lists. This could be seen as a dynamic programming problem where the | 102 | lists. This could be seen as a dynamic programming problem where the |
| 102 | iterative implementation is more intuitive than the recursive one. | 103 | iterative implementation is more intuitive than the recursive one. |
| 104 | |||
| 105 | ### Day 8: Playground | ||
| 106 | |||
| 107 | This one required some optimization effort for part 2... unless one is | ||
| 108 | already familiar with [the algorithm | ||
| 109 | described](https://en.wikipedia.org/wiki/Kruskal%27s_algorithm) | ||
| 110 | in the problem statement, and I was from back in the days of competitive | ||
| 111 | programming. In the end it was mostly a matter of figuring out the correct | ||
| 112 | [data structure to represent the groups of joint | ||
| 113 | boxes](https://en.wikipedia.org/wiki/Disjoint-set_data_structure) (or | ||
| 114 | a matter of remembering how it is implemented, if one already knows it). | ||