One by one multi-sources dijkstra

Revision en1, by snorkel, 2021-03-13 15:41:11

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.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English snorkel 2021-03-13 15:41:11 312 Initial revision (published)