How to solve this problem
I can't figure out the approach.Describe the approach in details please. Thanks in advance
# | 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 |
How to solve this problem
I can't figure out the approach.Describe the approach in details please. Thanks in advance
Name |
---|
First step, sort the edges according to weight. Second step, sort the query. Third step firstly takes the higher or equal weighted edges of the highest value of the query. then connect them through disjoint set union. here you can find the solution for the highest value of the query. In this way, by adding the edges according to the value of decreasing query you will get all solutions of the query.
osthir bro
Actually i get the idea after solving this problem. Anasis cobweb