| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 10 | 142 |
|
|
| 28450 | Ada and Path | 8 | 103 |
|
|
| 17261 | Bank robbery | 3 | 244 |
|
|
| 10145 | Birthday Cake | 7 | 255 |
|
|
| 1693 | Coconuts | 13 | 936 |
|
|
| 3579 | Disjoint Paths | 4 | 312 |
|
|
| 4110 | Fast Maximum Flow | 48 | 2839 |
|
|
| 373 | Greedy island | 6 | 509 |
|
|
| 962 | Intergalactic Map | 2 | 564 |
|
|
| 4206 | Fast Maximum Matching | 30 | 1966 |
|
|
| 4485 | MobiZone vs VinaGone | 7 | 321 |
|
|
| 4227 | "Shortest" pair of paths | 3 | 208 |
|
|
| 3868 | Total Flow | 11 | 1383 |
|
|
| 287 | Smart Network Administrator | 3 | 448 |
|
|
| 203 | Potholers | 22 | 2265 |
|
|
| 22379 | Mobile Company 2 | 2 | 69 |
|
|
| 4457 | Shopping II | 3 | 147 |
|
|
| 377 | Taxi | 14 | 1236 |
|
#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