Part 2 was as easy as part 2 of day 9 😂
At least if you started with an efficient solution in part 1.
Thinking about how to avoid allocations caused by inserting rows and columns made part 2 trivial. Just change a constant 🪄
Mean time (including parsing):
Part 1 and 2: 125µs
O(n^2) problem…
https://codeberg.org/mo8it/advent-of-code-2023/src/commit/7e697dca60f39a38291929913ed5887b71d9259a/day11/src
#AdventOfCode #AOC #AOC2023 #RustLang #Rust
Mo Bitar :ferris: /
npub1j7…5mapy
2023-12-11 13:33:26
Author Public Key
npub1j7fc87rk03whjh72mphc9hrm8zecfsdywdcscsesznwzcrasudvs75mapyPublished at
2023-12-11 13:33:26Event JSON
{
"id": "40673c04e7f905d22965d6887c3a14d0cfa82ecddd3dfb334d99b1358082125e",
"pubkey": "979383f8767c5d795fcad86f82dc7b38b384c1a473710c433014dc2c0fb0e359",
"created_at": 1702301606,
"kind": 1,
"tags": [
[
"t",
"adventofcode"
],
[
"t",
"aoc"
],
[
"t",
"aoc2023"
],
[
"t",
"rustlang"
],
[
"t",
"rust"
],
[
"content-warning",
"Advent of Code day 11 - Rust solution"
],
[
"proxy",
"https://fosstodon.org/users/mo8it/statuses/111562038106043092",
"activitypub"
]
],
"content": "Part 2 was as easy as part 2 of day 9 😂\n\nAt least if you started with an efficient solution in part 1.\n\nThinking about how to avoid allocations caused by inserting rows and columns made part 2 trivial. Just change a constant 🪄\n\nMean time (including parsing):\nPart 1 and 2: 125µs\n\nO(n^2) problem…\n\nhttps://codeberg.org/mo8it/advent-of-code-2023/src/commit/7e697dca60f39a38291929913ed5887b71d9259a/day11/src\n\n#AdventOfCode #AOC #AOC2023 #RustLang #Rust",
"sig": "a0678e55102dcb84cf1bb2d2eca915cfb53b00a3fcc3867ee0720c3b00eb9d2a895643f27dd9495eed6d0b951c1227a8be448ea9980704c7597346e2a2da7856"
}