| # | 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 | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Help with problem about Graph Theory
Hello all, So I came across this problem about Graph Theory and I am still not sure on how to solve this. https://vjudge.net/contest/78376#problem/B
I tried thinking about MST however what to do if in the final solution there are more than the number of connected components? MST will be taking the whole graph as a single component.
If talking about MST then, I think Kruskal might work, but not Prim. Am I right?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Masterkaiba | 2017-09-21 07:01:14 | 84 | ||
| en1 |
|
Masterkaiba | 2017-09-21 06:57:27 | 374 | Initial revision (published) |
