Advent of Code - Day 12
Part 1 : 3h56:00 (rank 10562)
Part 2 : 10h46:51 (rank 8638)
So far, this was the hardest day, by a mile.
I spent a long time in solving this problem, but I finally ended with a clear and concise code (about 80 lines).
Like most of the participants who solved the problem, I used a recursive search function with memoization. The code (in Scala) runs in about 600 ms for both parts combined.
I submitted a wrong answer again at my first attempt for Part 1.
#AdventOfCode
jpages /
npub1mr…ek4s2
2023-12-12 22:54:19
Author Public Key
npub1mr0wam5le7yta87mshdg2jrflgv9t0fq6gl4gkvaejw54k6z78gq9ek4s2Published at
2023-12-12 22:54:19Event JSON
{
"id": "30d4d1994bfeefec3dd4d3b36a41c9878042945e5fc5ef59d3ca46db4c483989",
"pubkey": "d8deeeee9fcf88be9fdb85da854869fa1855bd20d23f54599dcc9d4adb42f1d0",
"created_at": 1702421659,
"kind": 1,
"tags": [
[
"t",
"adventofcode"
]
],
"content": "Advent of Code - Day 12 \n\nPart 1 : 3h56:00 (rank 10562) \nPart 2 : 10h46:51 (rank 8638)\n\nSo far, this was the hardest day, by a mile.\n\nI spent a long time in solving this problem, but I finally ended with a clear and concise code (about 80 lines).\n\nLike most of the participants who solved the problem, I used a recursive search function with memoization. The code (in Scala) runs in about 600 ms for both parts combined.\n\nI submitted a wrong answer again at my first attempt for Part 1.\n\n#AdventOfCode",
"sig": "efe5723da507b9e2e10a53efd4fd51d4d606a6321a9aa87e707936d29f7900ed61d5f0b8bd82a1a346ec202313e1bafa6e7dd4175ab3a077e4d0cb63cd14c56e"
}