| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 9 | 94 |
|
|
| 28450 | Ada and Path | 7 | 74 |
|
|
| 17261 | Bank robbery | 2 | 233 |
|
|
| 10145 | Birthday Cake | 7 | 227 |
|
|
| 1693 | Coconuts | 12 | 645 |
|
|
| 3579 | Disjoint Paths | 4 | 305 |
|
|
| 4110 | Fast Maximum Flow | 39 | 2246 |
|
|
| 373 | Greedy island | 4 | 458 |
|
|
| 962 | Intergalactic Map | 4 | 526 |
|
|
| 4206 | Fast Maximum Matching | 24 | 1668 |
|
|
| 4485 | MobiZone vs VinaGone | 6 | 284 |
|
|
| 4227 | "Shortest" pair of paths | 3 | 182 |
|
|
| 3868 | Total Flow | 12 | 1291 |
|
|
| 287 | Smart Network Administrator | 3 | 401 |
|
|
| 203 | Potholers | 22 | 2002 |
|
|
| 22379 | Mobile Company 2 | 2 | 61 |
|
|
| 4457 | Shopping II | 3 | 129 |
|
|
| 377 | Taxi | 14 | 1187 |
|
#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