snorkel's blog

One by one multi-sources dijkstra
By snorkel, history, 4 years ago, In English

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.

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it
Hint
Solution
→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    Srry, I don't understand your solution. Can you describe little bit more about it? Or provide code if you have written it. Thanks.

    → Reply