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 | 60614 |
28.23%
|
11046 |
79.19%
|
|
|
|
793 - Network Connections | 44709 |
31.08%
|
9077 |
83.54%
|
|
|
|
912 - Live From Mars | 1167 |
24.68%
|
354 |
60.17%
|
|
|
|
10158 - War | 20242 |
33.78%
|
3922 |
80.98%
|
|
|
|
10301 - Rings and Glue | 9583 |
26.12%
|
2123 |
80.50%
|
|
|
|
10369 - Arctic Network | 21724 |
44.13%
|
5831 |
91.80%
|
|
|
|
10505 - Montesco vs Capuleto | 7995 |
29.31%
|
1914 |
79.21%
|
|
|
|
10583 - Ubiquitous Religions | 25816 |
50.33%
|
6775 |
92.62%
|
|
|
|
10608 - Friends | 44808 |
45.16%
|
10412 |
77.88%
|
|
|
|
11503 - Virtual Friends | 29168 |
42.49%
|
7138 |
89.69%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

