Problem O
Maximum Flow
Input
The first line of input contains a line with four
non-negative integers,
Output
The output should begin with a line containing three
integers
Then there should be
Sample Input 1 | Sample Output 1 |
---|---|
4 5 0 3 0 1 10 1 2 1 1 3 1 0 2 1 2 3 10 |
4 3 5 0 1 2 0 2 1 1 2 1 1 3 1 2 3 2 |
Sample Input 2 | Sample Output 2 |
---|---|
2 1 0 1 0 1 100000 |
2 100000 1 0 1 100000 |
Sample Input 3 | Sample Output 3 |
---|---|
2 1 1 0 0 1 100000 |
2 0 0 |