| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 33022 | Ada and Hose | 23 |
|
||
| 1693 | Coconuts | 13 | 948 |
|
|
| 34409 | Disconnected country | 1 | 44 |
|
|
| 9577 | Dynamic Tree Connectivity | 12 | 581 |
|
|
| 4485 | MobiZone vs VinaGone | 7 | 322 |
|
#min-cut
A cut is a partition of vertices of a graph into two subsets disjoint subsets. Minimum cut is a cut with a smallest possible cut-set.
https://en.wikipedia.org/wiki/Minimum_cut http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf
RSS