Hi coders!
Can anyone help me out, how to solve this problem on SPOJ? Any help/hint is appreciated.
Have nice day!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
Hi coders!
Can anyone help me out, how to solve this problem on SPOJ? Any help/hint is appreciated.
Have nice day!
Название |
---|
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