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 | 60759 |
28.28%
|
11050 |
79.19%
|
|
|
|
793 - Network Connections | 44735 |
31.09%
|
9081 |
83.55%
|
|
|
|
912 - Live From Mars | 1179 |
24.51%
|
355 |
60.28%
|
|
|
|
10158 - War | 20259 |
33.78%
|
3923 |
80.98%
|
|
|
|
10301 - Rings and Glue | 9587 |
26.13%
|
2123 |
80.50%
|
|
|
|
10369 - Arctic Network | 21746 |
44.15%
|
5838 |
91.80%
|
|
|
|
10505 - Montesco vs Capuleto | 8003 |
29.30%
|
1916 |
79.18%
|
|
|
|
10583 - Ubiquitous Religions | 25861 |
50.34%
|
6781 |
92.61%
|
|
|
|
10608 - Friends | 45014 |
45.25%
|
10423 |
77.90%
|
|
|
|
11503 - Virtual Friends | 29197 |
42.51%
|
7142 |
89.69%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

