| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 4 | 60 |
|
|
| 28450 | Ada and Path | 5 | 55 |
|
|
| 17261 | Bank robbery | 2 | 183 |
|
|
| 10145 | Birthday Cake | 8 | 201 |
|
|
| 1693 | Coconuts | 8 | 599 |
|
|
| 3579 | Disjoint Paths | 2 | 287 |
|
|
| 4110 | Fast Maximum Flow | 31 | 1986 |
|
|
| 373 | Greedy island | 2 | 421 |
|
|
| 962 | Intergalactic Map | 4 | 506 |
|
|
| 4206 | Fast Maximum Matching | 16 | 1480 |
|
|
| 4485 | MobiZone vs VinaGone | 4 | 247 |
|
|
| 4227 | "Shortest" pair of paths | 3 | 174 |
|
|
| 3868 | Total Flow | 9 | 1225 |
|
|
| 287 | Smart Network Administrator | 3 | 387 |
|
|
| 203 | Potholers | 18 | 1828 |
|
|
| 22379 | Mobile Company 2 | 1 | 52 |
|
|
| 4457 | Shopping II | 2 | 120 |
|
|
| 377 | Taxi | 11 | 1141 |
|
#max-flow
The problem involves maximum flow problem
https://en.wikipedia.org/wiki/Maximum_flow_problem http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf
RSS