Advent of Code - Day 17
Part 1 : 7h45:45 (rank 7415)
Part 2 : 10h30:44 (rank 8213)
Today's problem was really tough, as I expected. This was the classic pathfinding problem.
I struggled and I spent way too much time on my Dijkstra algorithm implementation. My first working version was too slow (20 seconds for Part 1 !), and I had to reengineer it completely.
After the stars validations, I improved the performance. Part 1 now runs in 100 ms and Part 2 in 200 ms.
#AdventOfCode
jpages /
npub1mr…ek4s2
2023-12-17 22:33:28
Author Public Key
npub1mr0wam5le7yta87mshdg2jrflgv9t0fq6gl4gkvaejw54k6z78gq9ek4s2Published at
2023-12-17 22:33:28Event JSON
{
"id": "4febe2352f11004163e3bfe50e099e253c5cbd5e8cd9fdd08868b33f06d590e3",
"pubkey": "d8deeeee9fcf88be9fdb85da854869fa1855bd20d23f54599dcc9d4adb42f1d0",
"created_at": 1702852408,
"kind": 1,
"tags": [
[
"t",
"adventofcode"
]
],
"content": "Advent of Code - Day 17 \n\nPart 1 : 7h45:45 (rank 7415)\nPart 2 : 10h30:44 (rank 8213)\n\nToday's problem was really tough, as I expected. This was the classic pathfinding problem.\n\nI struggled and I spent way too much time on my Dijkstra algorithm implementation. My first working version was too slow (20 seconds for Part 1 !), and I had to reengineer it completely.\n\nAfter the stars validations, I improved the performance. Part 1 now runs in 100 ms and Part 2 in 200 ms.\n\n#AdventOfCode",
"sig": "bfcc30a0b0555f31dce369b748c0a2b978848f4ee431c7631adbbe89396767dc8fec6a42c9d2fca2df6939ab13957eb88f6f613cf8f191eadb05402cd6f255e5"
}