| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 6 | 78 |
|
|
| 28450 | Ada and Path | 5 | 65 |
|
|
| 17261 | Bank robbery | 2 | 229 |
|
|
| 10145 | Birthday Cake | 6 | 217 |
|
|
| 1693 | Coconuts | 10 | 630 |
|
|
| 3579 | Disjoint Paths | 3 | 298 |
|
|
| 4110 | Fast Maximum Flow | 35 | 2158 |
|
|
| 373 | Greedy island | 3 | 446 |
|
|
| 962 | Intergalactic Map | 4 | 519 |
|
|
| 4206 | Fast Maximum Matching | 25 | 1607 |
|
|
| 4485 | MobiZone vs VinaGone | 5 | 275 |
|
|
| 4227 | "Shortest" pair of paths | 3 | 180 |
|
|
| 3868 | Total Flow | 9 | 1271 |
|
|
| 287 | Smart Network Administrator | 3 | 397 |
|
|
| 203 | Potholers | 21 | 1953 |
|
|
| 22379 | Mobile Company 2 | 1 | 59 |
|
|
| 4457 | Shopping II | 3 | 128 |
|
|
| 377 | Taxi | 11 | 1162 |
|
#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