N cars and M parking lots are given. They are situated on a rectangular surface (represented by a table), where certain cells are impassable. Each parking lot can have at most one car assigned to it.

Find a way to assign each car to a parking lot, so that the greatest of the shortest distances from each car to its assigned parking lot is as small as possible.

Question

N cars and M parking lots are given. They are situated on a rectangular surface (represented by a table), where certain cells are impassable. Each parking lot can have at most one car assigned to it.

Find a way to assign each car to a parking lot, so that the greatest of the shortest distances from each car to its assigned parking lot is as small as possible.

istim · Answer

Darn brain teasers.

anonymous · Answer

Network flow problem, advance graph theory.

istim · Answer

Oh.

anonymous · Answer

right

anonymous · Answer

This ( http://community.topcoder.com/stat?c=problem_statement&pm=3530&rd=6535) should help.

anonymous · Answer

Btw, It seems to me that they are duplicates ?! If yes, Please read  TC copyrights :)

anonymous · Answer

so the solution looks like a graph?