mirror of
https://github.com/RussellChamp/advent-of-code-2025-cursor.git
synced 2026-10-27 23:52:34 +00:00
Turns out two simple heuristics solve the whole problem in 4ms: 1. Does the area fit? No → invalid 2. Are there enough 3x3 spaces for all presents? Yes → valid But hey, at least we learned how to use Dancing Links for a problem that didn't need it. The dlx crate thanks us for the download stats.
35 lines
150 B
Plaintext
35 lines
150 B
Plaintext
0:
|
|
###
|
|
##.
|
|
##.
|
|
|
|
1:
|
|
###
|
|
##.
|
|
.##
|
|
|
|
2:
|
|
.##
|
|
###
|
|
##.
|
|
|
|
3:
|
|
##.
|
|
###
|
|
##.
|
|
|
|
4:
|
|
###
|
|
#..
|
|
###
|
|
|
|
5:
|
|
###
|
|
.#.
|
|
###
|
|
|
|
4x4: 0 0 0 0 2 0
|
|
12x5: 1 0 1 0 2 2
|
|
12x5: 1 0 1 0 3 2
|
|
|