Files
Russell Champoux d8a67cf515 Add Day 12 solution (ft. an unused DLX library)
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.
2026-01-05 16:13:55 -05:00

35 lines
696 B
TOML

[package]
name = "advent_of_code"
version = "0.12.0"
authors = ["Felix Spöttel <1682504+fspoettel@users.noreply.github.com>"]
edition = "2024"
default-run = "advent_of_code"
publish = false
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
[lib]
doctest = false
[profile.dhat]
inherits = "release"
debug = 1
[features]
dhat-heap = ["dhat"]
today = ["chrono"]
test_lib = []
[dependencies]
# Template dependencies
chrono = { version = "0.4.38", optional = true }
dhat = { version = "0.3.3", optional = true }
dlx = "0.8.5"
itertools = "0.14.0"
pico-args = "0.5.0"
rayon = "1.11.0"
smallvec = "1.15.1"
tinyjson = "2.5.1"
# Solution dependencies