← Questions
Assign robots to their nearest pickup items on a grid with obstacles
0
I was asked this
No reports yet. Sign in to say where you were asked it.
On an m x n grid with obstacles there are k robots and k items. Send each robot to one item, preferring the item nearest to it by walking distance. Several robots can share the same nearest item, so define and apply a rule for those conflicts, and return the assignment.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding