AlgoMaster Logo

Campus Bikes II

workers=[[0,0],[2,1]],bikes=[[1,2],[3,3]]
0 / 22
Coordinate GridW0(0,0)W1(2,1)B0(1,2)B1(3,3)WorkerBikeDP Array (by bike bitmask)000
algomaster.io
Step:Start: 2 workers, 2 bikes. Use bitmask DP to find minimum total distance.