| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 4 | 57 |
|
|
| 28450 | Ada and Path | 5 | 52 |
|
|
| 17261 | Bank robbery | 2 | 182 |
|
|
| 10145 | Birthday Cake | 7 | 197 |
|
|
| 1693 | Coconuts | 8 | 591 |
|
|
| 3579 | Disjoint Paths | 2 | 286 |
|
|
| 4110 | Fast Maximum Flow | 28 | 1925 |
|
|
| 373 | Greedy island | 2 | 415 |
|
|
| 962 | Intergalactic Map | 3 | 501 |
|
|
| 4206 | Fast Maximum Matching | 15 | 1449 |
|
|
| 4485 | MobiZone vs VinaGone | 4 | 238 |
|
|
| 4227 | "Shortest" pair of paths | 3 | 174 |
|
|
| 3868 | Total Flow | 8 | 1208 |
|
|
| 287 | Smart Network Administrator | 3 | 382 |
|
|
| 203 | Potholers | 19 | 1819 |
|
|
| 22379 | Mobile Company 2 | 1 | 52 |
|
|
| 4457 | Shopping II | 2 | 118 |
|
|
| 377 | Taxi | 12 | 1130 |
|
#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