Hi coders!
Can anyone help me out, how to solve this problem on SPOJ? Any help/hint is appreciated.
Have nice day!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
5 | atcoder_official | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
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