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 | 60425 |
28.16%
|
11037 |
79.18%
|
|
|
|
793 - Network Connections | 44659 |
31.07%
|
9068 |
83.51%
|
|
|
|
912 - Live From Mars | 1166 |
24.61%
|
354 |
60.17%
|
|
|
|
10158 - War | 20225 |
33.74%
|
3917 |
80.95%
|
|
|
|
10301 - Rings and Glue | 9583 |
26.12%
|
2123 |
80.50%
|
|
|
|
10369 - Arctic Network | 21720 |
44.12%
|
5831 |
91.80%
|
|
|
|
10505 - Montesco vs Capuleto | 7980 |
29.30%
|
1911 |
79.17%
|
|
|
|
10583 - Ubiquitous Religions | 25796 |
50.33%
|
6772 |
92.63%
|
|
|
|
10608 - Friends | 44628 |
45.03%
|
10406 |
77.87%
|
|
|
|
11503 - Virtual Friends | 29163 |
42.49%
|
7137 |
89.69%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

