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 | 59909 |
28.05%
|
11012 |
79.15%
|
|
|
|
793 - Network Connections | 44594 |
31.03%
|
9053 |
83.50%
|
|
|
|
912 - Live From Mars | 1162 |
24.53%
|
353 |
60.06%
|
|
|
|
10158 - War | 20183 |
33.73%
|
3909 |
80.89%
|
|
|
|
10301 - Rings and Glue | 9558 |
26.09%
|
2121 |
80.48%
|
|
|
|
10369 - Arctic Network | 21646 |
44.14%
|
5825 |
91.81%
|
|
|
|
10505 - Montesco vs Capuleto | 7969 |
29.28%
|
1907 |
79.18%
|
|
|
|
10583 - Ubiquitous Religions | 25682 |
50.19%
|
6749 |
92.62%
|
|
|
|
10608 - Friends | 44317 |
44.87%
|
10386 |
77.84%
|
|
|
|
11503 - Virtual Friends | 29103 |
42.43%
|
7129 |
89.68%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |


