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...

  • TIMUS - 1036 Lucky Tickets
    Link to the problem on Timus Online Judge First of all there are two kinds of input which the answer is zero, first if sum % 2 == 1 or se...
  • TIMUS - 1120 Sum of sequential numbers
    Link to the problem on Timus Online Judge The problem statement is completely straight forward with no hidden tricks :). Yeah yeah I know...
  • TIMUS - 1207 Median on the plane
    Link to the problem on Timus Online Judge  This is a Computational Geometry problem. No 3 points lie on the same line and this is a great...