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 | 60717 |
28.26%
|
11048 |
79.19%
|
|
|
|
793 - Network Connections | 44718 |
31.08%
|
9078 |
83.54%
|
|
|
|
912 - Live From Mars | 1167 |
24.68%
|
354 |
60.17%
|
|
|
|
10158 - War | 20257 |
33.78%
|
3923 |
80.98%
|
|
|
|
10301 - Rings and Glue | 9583 |
26.12%
|
2123 |
80.50%
|
|
|
|
10369 - Arctic Network | 21728 |
44.12%
|
5833 |
91.79%
|
|
|
|
10505 - Montesco vs Capuleto | 8001 |
29.30%
|
1916 |
79.18%
|
|
|
|
10583 - Ubiquitous Religions | 25834 |
50.34%
|
6777 |
92.61%
|
|
|
|
10608 - Friends | 44852 |
45.18%
|
10419 |
77.90%
|
|
|
|
11503 - Virtual Friends | 29174 |
42.49%
|
7139 |
89.69%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |


