How to solve this kattis problem? It is a multi-source but not once, one by one. You should count the number of vertices with the distance at least k after each source is added. Restarting dijkstra every time is not enough.
Thanks.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
How to solve this kattis problem? It is a multi-source but not once, one by one. You should count the number of vertices with the distance at least k after each source is added. Restarting dijkstra every time is not enough.
Thanks.
Name |
---|
Take advantage of K being small. Maybe incorporate into state somehow?
Define nodes based on two parameters (location, distance from alien base). Run a modified Dijkstra where you find the minimum input id of an alien base that can reach each node. This works because if two alien bases can both reach a town with the same distance D, then for all other nodes reachable from this node, the base with smaller id will always get there earlier.
Srry, I don't understand your solution. Can you describe little bit more about it? Or provide code if you have written it. Thanks.
https://ideone.com/ER1jNn
Thanks, I got it. By the way, isn't there more standard (closer to standard dijkstra) solution?