warrence/AdventOfCode2025
1
0
Fork 0
Code Actions Activity

Update readme for "Day 5: Cafeteria"

Browse Source
This commit is contained in:
Stefan Müller
2026-02-06 00:14:45 +01:00
parent 5c95df93b7
commit 21c31e8430
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
+2
View File
@@ -42,6 +42,8 @@ For part 2, the accessible locations are tracked, and removed individually from
:mag_right: Puzzle: <https://adventofcode.com/2025/day/5>, :white_check_mark: Solver: [`Cafeteria`](src/solvers/cafeteria.rs) :mag_right: Puzzle: <https://adventofcode.com/2025/day/5>, :white_check_mark: Solver: [`Cafeteria`](src/solvers/cafeteria.rs)
From the input data, we construct a [`MultiInterval`](src/common/interval.rs), which is a ordered set of integer intervals (based on a [B-tree](https://doc.rust-lang.org/std/collections/struct.BTreeSet.html)), such that all contained intervals are disjoint. With this data structure, testing for containment and determining the number of contained integers becomes trivial.
### Day 6: Trash Compactor ### Day 6: Trash Compactor
:mag_right: Puzzle: <https://adventofcode.com/2025/day/6>, :white_check_mark: Solver: [`TrashCompactor`](src/solvers/trash_compactor.rs) :mag_right: Puzzle: <https://adventofcode.com/2025/day/6>, :white_check_mark: Solver: [`TrashCompactor`](src/solvers/trash_compactor.rs)