Wednesday, September 18, 2013

POJ - Drainage Ditches

Link to the problem on Peking Online Judge

This is a primitive and classic Maximum Flow Problem.
We have a weighted directed graph in this problem, and we need to find maximum flow from node 1 to node M.
at
Labels: , ,

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

USACO - Prime Palindromes

I just skimmed the problem statement and panicked of the high boundary of the input, but something inside told me don't worry everyth...

  • USACO - Arithmetic Progressions
    Let's think about it, Have you noticed the small boundary of N & M, What can we do with this small boundary? Isn't producing al...
  • USACO - Prime Cryptarithm
    Prime Cryptarithm The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set ...
  • AvoidRoads - 2003 TCO Semifinals 4 - TopCoder
    Dynamic Programming The problem wants to know in how many ways one can reach destination ( cell[width][height] ) If there were no obstacle...