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 | 60184 |
28.11%
|
11033 |
79.17%
|
|
|
|
793 - Network Connections | 44639 |
31.06%
|
9064 |
83.52%
|
|
|
|
912 - Live From Mars | 1165 |
24.55%
|
354 |
60.17%
|
|
|
|
10158 - War | 20210 |
33.74%
|
3915 |
80.92%
|
|
|
|
10301 - Rings and Glue | 9581 |
26.10%
|
2123 |
80.50%
|
|
|
|
10369 - Arctic Network | 21662 |
44.13%
|
5829 |
91.82%
|
|
|
|
10505 - Montesco vs Capuleto | 7976 |
29.29%
|
1910 |
79.16%
|
|
|
|
10583 - Ubiquitous Religions | 25784 |
50.31%
|
6768 |
92.63%
|
|
|
|
10608 - Friends | 44556 |
44.98%
|
10401 |
77.86%
|
|
|
|
11503 - Virtual Friends | 29158 |
42.48%
|
7135 |
89.68%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

