hello, in this sum question I have been trying to implement a modified dijsktra but fail. I just want to know if modified dijsktra work here.
please don't give further hints
№ | Пользователь | Рейтинг |
---|---|---|
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 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
hello, in this sum question I have been trying to implement a modified dijsktra but fail. I just want to know if modified dijsktra work here.
please don't give further hints
Название |
---|
I am not sure what you mean by modified Dijkstra,
but I did solve it with Dijkstra.
thanks, i will try more .. modified dijsktra means it has slight modification .. okay sorry if it confuses
Good luck :)
so, earlier I was trying to just use some kind of hash to track the weights. but then I realised, I could just stotre the nodes of shortest path and take 2 consecutive nodes and mark the precomputed hashng of edges with those 2 vertices as true.. then just print indices of vertices which are false after getting all shortest paths..
what did u do
My solution doesn't have hashing actually.
What I did was: do a All-Pairs Shortest Path by using Dijkstra V times.
Then I enumerate through each edge, and see if the shortest path between any pairs of nodes pass that edge.
The whole solution works in O(V3 + E * V2).
The complexity is kind of lousy, but we have 8 minutes to work with.