Hi coders!
Can anyone help me out, how to solve this problem on SPOJ? Any help/hint is appreciated.
Have nice day!
Hi coders!
Can anyone help me out, how to solve this problem on SPOJ? Any help/hint is appreciated.
Have nice day!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
https://en.wikipedia.org/wiki/Prim%27s_algorithm
I guess straightforward solution will work. Store also number of ways to reach certain vertex with minimal cost.
this problem sums up a hell lot of topics in graph theory and mathematics , misof wrote a solution to it on topcoder and I learnt from them (the problem and the solution) more than I learnt from any textbook or course