| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
I came across this problem : 1242B - 0-1 MST It requires us to find components of the complement of the graph. The editorial asks us to use DSU (Disjoint set union) to find the components but I'm not able to understand how to proceed after initializing the DSU.
Any suggestion / comment is greatly appreciated.
Problem is the same as 190E - Counter Attack and 920E - Connected Components?, if you want to look at more solutions. I have to imagine most people used a BFS to solve it than DSU. Amusingly, I used a BFS when solving 920E, but a DSU when solving 1242B.
920E BFS solution: https://mirror.codeforces.com/contest/920/submission/34879429 1242B DSU solution: https://mirror.codeforces.com/contest/1242/submission/64392337.
The core idea for my DSU solution is to consider the adjacency list of the graph. Say node $$$u$$$ is connected to vertices $$$v_1, v_2, \ldots, v_k$$$ which are in sorted order ($$$v_1 < v_2 < \ldots < v_k$$$). Then we need to merge vertex $$$u$$$ with the ranges $$$[0, v_1 - 1]$$$, $$$[v_1 + 1, v_2 - 1]$$$, and so on. To do this efficiently, we can merge those ranges by keeping track of the largest range starting at each index, and then merging $$$u$$$ with the start of each range. This runs in $$$O(m \alpha(n))$$$.
Thanks a lot.