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 | 58442 |
27.82%
|
10940 |
79.09%
|
|
|
|
793 - Network Connections | 43850 |
30.75%
|
9013 |
83.46%
|
|
|
|
912 - Live From Mars | 1155 |
24.42%
|
350 |
60.29%
|
|
|
|
10158 - War | 19981 |
33.62%
|
3877 |
80.84%
|
|
|
|
10301 - Rings and Glue | 9492 |
26.01%
|
2106 |
80.44%
|
|
|
|
10369 - Arctic Network | 21333 |
43.97%
|
5783 |
91.82%
|
|
|
|
10505 - Montesco vs Capuleto | 7796 |
29.55%
|
1895 |
79.31%
|
|
|
|
10583 - Ubiquitous Religions | 25212 |
49.76%
|
6709 |
92.59%
|
|
|
|
10608 - Friends | 42322 |
43.75%
|
10276 |
77.69%
|
|
|
|
11503 - Virtual Friends | 28735 |
42.14%
|
7090 |
89.68%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

