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 | 55979 |
27.69%
|
10745 |
79.10%
|
|
![]() |
793 - Network Connections | 42888 |
30.66%
|
8937 |
83.37%
|
|
![]() |
912 - Live From Mars | 1139 |
24.32%
|
347 |
59.94%
|
|
![]() |
10158 - War | 19293 |
33.68%
|
3790 |
80.84%
|
|
![]() |
10301 - Rings and Glue | 9300 |
25.76%
|
2091 |
80.39%
|
|
![]() |
10369 - Arctic Network | 20752 |
43.63%
|
5650 |
91.86%
|
|
![]() |
10505 - Montesco vs Capuleto | 7371 |
29.55%
|
1865 |
79.41%
|
|
![]() |
10583 - Ubiquitous Religions | 24362 |
49.40%
|
6590 |
92.56%
|
|
![]() |
10608 - Friends | 39057 |
42.46%
|
10029 |
77.29%
|
|
![]() |
11503 - Virtual Friends | 27888 |
41.94%
|
6981 |
89.64%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |