Advent of Code - Day 21
Part 1 : 05h17:57 (rank 10217)
Part 2 : 10h27:42 (rank 4411)
I started very late, but I worked fast for Part 1 (maybe half an hour). I used a very classic BFS algorithm.
Part 2 was much harder, but I found the correct idea (find a cycle in the reachable cells growth sequence) faster than yesterday, and I got my best rank so far this year.
Part 1 runs in 20 ms, and Part 2 in 200 ms.
#AdventOfCode
jpages /
npub1mr…ek4s2
2023-12-21 18:37:17
Author Public Key
npub1mr0wam5le7yta87mshdg2jrflgv9t0fq6gl4gkvaejw54k6z78gq9ek4s2Published at
2023-12-21 18:37:17Event JSON
{
"id": "a1a98498b34486b3b89f74be686e991aedc5415a82478925a78816f84246d3cb",
"pubkey": "d8deeeee9fcf88be9fdb85da854869fa1855bd20d23f54599dcc9d4adb42f1d0",
"created_at": 1703183837,
"kind": 1,
"tags": [
[
"t",
"adventofcode"
]
],
"content": "Advent of Code - Day 21 \n\nPart 1 : 05h17:57 (rank 10217)\nPart 2 : 10h27:42 (rank 4411)\n\nI started very late, but I worked fast for Part 1 (maybe half an hour). I used a very classic BFS algorithm.\n\nPart 2 was much harder, but I found the correct idea (find a cycle in the reachable cells growth sequence) faster than yesterday, and I got my best rank so far this year.\n\nPart 1 runs in 20 ms, and Part 2 in 200 ms.\n\n#AdventOfCode",
"sig": "ee55440e3bc84d65768262686b2f4adfa34e521d7eb7b9d51bf4e8da85bb4039468933af76b379d83dc680c7ae069b0e2bde5a37d31056bd867b2200e0fe7b21"
}