This problem is good. Day_21 and Day_17.2 the only one I enjoyed so far for this year. Also Idk if you noticed this but for a robot aside from shortest path, it was never optimal to make too many turns(change in moving direction) when moving from src(u) to dest(v). So there is only 2 options at most when moving from u to v. Either the robot do delta_row -> delta_col or delta_col -> delta_row. Might actually step on invalid cell in between tho. Just need to counter that. It won't matter much due to small grid + only 26 level depth dfs + cache.
While it is great to know the complexity of 25 proxy robots, we actually have no clue what steps exactly we have to type in to open the door and let the missing missing Historian free.
Nice solution! I wasn't able to wrap my head around it and didn't enjoy the debugging experience at all with all the ^v all over the place. 42:49 I wonder why this is correct though. Do the robot arms _always_ go to the A key first? I thought they only start there and then stay where they are. Anyway. I think I'll just convert your solution to rust and call it a day ;-)
Excellent explanation of the approach. Also love your approach of showing off an optimized solution instead of the competition solution.
you are a blessing
Thanks so much, I could never solve this on my own.
Actually thank you so much!!!!
Great work! Thanks for the explanation
Part 2 was wild, even with your great explanation it still took me far too long to understand it and write a solution
How are you seem to be so unaffected by cognitive load? Your explanation is so concentrated and enjoyable. Not a single redundant word.
This problem is good. Day_21 and Day_17.2 the only one I enjoyed so far for this year. Also Idk if you noticed this but for a robot aside from shortest path, it was never optimal to make too many turns(change in moving direction) when moving from src(u) to dest(v). So there is only 2 options at most when moving from u to v. Either the robot do delta_row -> delta_col or delta_col -> delta_row. Might actually step on invalid cell in between tho. Just need to counter that. It won't matter much due to small grid + only 26 level depth dfs + cache.
While it is great to know the complexity of 25 proxy robots, we actually have no clue what steps exactly we have to type in to open the door and let the missing missing Historian free.
Maybe we were just seeing if it's worth it to rely on the robot network, and if it's too complex, we'll just find another way
Nice solution! I wasn't able to wrap my head around it and didn't enjoy the debugging experience at all with all the ^v all over the place.
42:49 I wonder why this is correct though. Do the robot arms _always_ go to the A key first? I thought they only start there and then stay where they are.
Anyway. I think I'll just convert your solution to rust and call it a day ;-)
They initially start at the A, and each code finishes at A