Week 9 - Maximum Flow

Question

The tasks for week 9 are as follows:

Week problem: 00820 Internet Bandwidth
Weekend problem: 10480 Sabotage
Suggested bonus: 10594 Data Flow

Read up on maximum flow.

You must submit your solutions on http://uva.onlinejudge.org/

You can browse to these problems from the online judge website by clicking on Browse Problems, Contest Volumes, and then selecting the contest volume as indicated above.

Comments

Please post below which of the questions you have been able to finish.

For each task, please let us know how much time you have spent on understanding / coding / debugging.

For each task let us know what the hardest part was. (This can be anything, ranging from not having read the problem to forgetting about a border case, to a semicolon in the wrong spot that screwed up an if-statement...)

Answer 1

Max flow is excluded from the IOI syllabus: http://people.ksp.sk/~misof/ioi-syllabus/ioi-syllabus.pdf

Comments

We believe that maximum flow algorithms are useful techniques to know at this level of competition. Just because the syllabus excludes the topic does not mean that a task (or part thereof) will not be solvable using a maximum flow algorithm - just that the intended solution will not use such an algorithm.