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 | 59293 |
27.89%
|
10985 |
79.10%
|
|
|
|
793 - Network Connections | 44437 |
30.96%
|
9036 |
83.48%
|
|
|
|
912 - Live From Mars | 1159 |
24.42%
|
353 |
60.06%
|
|
|
|
10158 - War | 20085 |
33.66%
|
3888 |
80.81%
|
|
|
|
10301 - Rings and Glue | 9521 |
26.05%
|
2115 |
80.43%
|
|
|
|
10369 - Arctic Network | 21577 |
44.08%
|
5809 |
91.81%
|
|
|
|
10505 - Montesco vs Capuleto | 7952 |
29.30%
|
1903 |
79.19%
|
|
|
|
10583 - Ubiquitous Religions | 25418 |
49.93%
|
6729 |
92.60%
|
|
|
|
10608 - Friends | 43910 |
44.67%
|
10353 |
77.79%
|
|
|
|
11503 - Virtual Friends | 28955 |
42.30%
|
7113 |
89.68%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

