| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 11 | 154 |
|
|
| 28450 | Ada and Path | 9 | 109 |
|
|
| 17261 | Bank robbery | 3 | 254 |
|
|
| 10145 | Birthday Cake | 7 | 260 |
|
|
| 1693 | Coconuts | 14 | 965 |
|
|
| 3579 | Disjoint Paths | 4 | 318 |
|
|
| 4110 | Fast Maximum Flow | 48 | 3042 |
|
|
| 373 | Greedy island | 6 | 516 |
|
|
| 962 | Intergalactic Map | 2 | 568 |
|
|
| 4206 | Fast Maximum Matching | 32 | 2081 |
|
|
| 4485 | MobiZone vs VinaGone | 7 | 338 |
|
|
| 4227 | "Shortest" pair of paths | 3 | 214 |
|
|
| 3868 | Total Flow | 11 | 1398 |
|
|
| 287 | Smart Network Administrator | 3 | 458 |
|
|
| 203 | Potholers | 22 | 2279 |
|
|
| 22379 | Mobile Company 2 | 3 | 73 |
|
|
| 4457 | Shopping II | 3 | 152 |
|
|
| 377 | Taxi | 14 | 1245 |
|
#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