1066. Campus Bikes II
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmaskHungarian AlgorithmBipartite GraphSuccessive Shortest Path AlgorithmMatching (Graph)Minimum-Cost FlowFlow Network
Hints
Hint 1
Model the problem with a dp(pos, mask) where pos represents the current bike to be assigned and mask the set of available workers.
Preparing judge…