Dwylkz

/* This Problem beat me completely. Beat my template completely. Beat my funtion comletely. Waste my time comletely. It's a naked maximum-stream problem. The main point is your tem

/* Maximum-stream again. We can divide the graph into 5 part. super-source -----> food -----> customer -----> drink -----> super-sink fi 1 1 dj

/* This problem corrspond to kind of Minimum-Cut staff Split a city into two node(I'd love to call it input-node and output-node). Connect them with a directed edge and the edge's capacity as th