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 | 58808 |
27.84%
|
10961 |
79.09%
|
|
|
|
793 - Network Connections | 44136 |
30.89%
|
9028 |
83.47%
|
|
|
|
912 - Live From Mars | 1157 |
24.37%
|
352 |
59.94%
|
|
|
|
10158 - War | 20050 |
33.68%
|
3887 |
80.83%
|
|
|
|
10301 - Rings and Glue | 9507 |
26.01%
|
2110 |
80.38%
|
|
|
|
10369 - Arctic Network | 21449 |
43.94%
|
5799 |
91.79%
|
|
|
|
10505 - Montesco vs Capuleto | 7894 |
29.34%
|
1901 |
79.22%
|
|
|
|
10583 - Ubiquitous Religions | 25316 |
49.86%
|
6719 |
92.59%
|
|
|
|
10608 - Friends | 43306 |
44.32%
|
10312 |
77.72%
|
|
|
|
11503 - Virtual Friends | 28879 |
42.23%
|
7104 |
89.67%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |


