why every problem is so wordy...Why cannot any fix this?

Binary search + Max flow.

A template problem.

any sides means it can also go through diagonally?? please tell

The sample case is terrible! Can anyone give a more detailed example, with more bikes and bikes?

i created distances from all the bikers to all the bikes and put it in a 2D matrix. and i searched the values from minimum to highest, until i get values from K rows and K colunms(so that a all K bikers get a bike) but only first 6 test cases pass. i bought a test case and i found out that my answer is lower than the expected value. any clue??