Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Browse Problems
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 2. Data Structures and Libraries :: Data Structures With Our-Own Libraries :: Union-Find Disjoint Sets
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
459 - Graph Connectivity | 59577 |
27.97%
|
10998 |
79.12%
|
|
|
|
793 - Network Connections | 44498 |
30.97%
|
9043 |
83.49%
|
|
|
|
912 - Live From Mars | 1159 |
24.42%
|
353 |
60.06%
|
|
|
|
10158 - War | 20101 |
33.67%
|
3893 |
80.79%
|
|
|
|
10301 - Rings and Glue | 9526 |
26.04%
|
2115 |
80.43%
|
|
|
|
10369 - Arctic Network | 21611 |
44.11%
|
5819 |
91.80%
|
|
|
|
10505 - Montesco vs Capuleto | 7952 |
29.30%
|
1903 |
79.19%
|
|
|
|
10583 - Ubiquitous Religions | 25590 |
50.08%
|
6740 |
92.61%
|
|
|
|
10608 - Friends | 44079 |
44.76%
|
10366 |
77.81%
|
|
|
|
11503 - Virtual Friends | 29039 |
42.38%
|
7121 |
89.69%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |


