| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 4 | 65 |
|
|
| 28450 | Ada and Path | 5 | 58 |
|
|
| 17261 | Bank robbery | 2 | 229 |
|
|
| 10145 | Birthday Cake | 8 | 202 |
|
|
| 1693 | Coconuts | 10 | 611 |
|
|
| 3579 | Disjoint Paths | 2 | 290 |
|
|
| 4110 | Fast Maximum Flow | 31 | 2025 |
|
|
| 373 | Greedy island | 2 | 426 |
|
|
| 962 | Intergalactic Map | 4 | 509 |
|
|
| 4206 | Fast Maximum Matching | 17 | 1513 |
|
|
| 4485 | MobiZone vs VinaGone | 4 | 252 |
|
|
| 4227 | "Shortest" pair of paths | 3 | 175 |
|
|
| 3868 | Total Flow | 9 | 1241 |
|
|
| 287 | Smart Network Administrator | 3 | 390 |
|
|
| 203 | Potholers | 18 | 1893 |
|
|
| 22379 | Mobile Company 2 | 1 | 53 |
|
|
| 4457 | Shopping II | 2 | 124 |
|
|
| 377 | Taxi | 11 | 1146 |
|
#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