Advent of Code - Day 16
Part 1 : 1h33:20 (rank 5030)
Part 2 : 1h44:15 (rank 4656)
This problem was easier than expected.
For Part 1, I used a recursive algorithm for the beam simulation (whereas many people used BFS), with bitwise operations to accelerate the code. This part executes in 800 µs.
In Part 2, I simply repeated this process for every border tile (440 for the input data), and got my best ranking so far.
#AdventOfCode
jpages /
npub1mr…ek4s2
2023-12-16 22:54:34
Author Public Key
npub1mr0wam5le7yta87mshdg2jrflgv9t0fq6gl4gkvaejw54k6z78gq9ek4s2Published at
2023-12-16 22:54:34Event JSON
{
"id": "4d9f9ae8ad529b116b65e6d522de5232c09c3c56d004f442436fd4a030c58646",
"pubkey": "d8deeeee9fcf88be9fdb85da854869fa1855bd20d23f54599dcc9d4adb42f1d0",
"created_at": 1702767274,
"kind": 1,
"tags": [
[
"t",
"adventofcode"
]
],
"content": "Advent of Code - Day 16 \n\nPart 1 : 1h33:20 (rank 5030)\nPart 2 : 1h44:15 (rank 4656)\n\nThis problem was easier than expected.\n\nFor Part 1, I used a recursive algorithm for the beam simulation (whereas many people used BFS), with bitwise operations to accelerate the code. This part executes in 800 µs.\n\nIn Part 2, I simply repeated this process for every border tile (440 for the input data), and got my best ranking so far.\n\n#AdventOfCode",
"sig": "d50899f64dab72ce1bdaccad6935607e605c6fea36cc970173a561f6571686caf22836252c6e05eba15e741ccb516411b42c6e7caefdb32386f5dd29d6c47397"
}