Maximum Pig Sales Using Maximum Flow and Layered Graph
A farm has M locked pig pens, each initially containing a certain number of pigs. A worker named Milk needs to sell pigs to N customers who arrive sequentially. Each customer holds keys to some pens and wants to buy a specific number of pigs. The worker can open any pen that a cutsomer has access to...