Codeforces Problem 144D.

Revision en2, by sidchelseafan, 2015-06-28 10:59:44

This is regarding 144D - Ракетные шахты. The problem gives an weighted undirected graph and asks us to calculate all points (not just vertices, they can be points on edges as well ) which have shortest distance equal to some given value.

I realise this is a simple Djikstra, but I am unable to understand the three cases that are given here Editorial .

I am having a real hard time understanding it(I tried reading others code, but still couldn't get it), Could someone please explain it to me. Thanks. Much appreciated.

Tags dijkstra, shortest path, graphs

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English sidchelseafan 2015-06-28 10:59:44 0 (published)
en1 English sidchelseafan 2015-06-28 10:59:24 588 Initial revision (saved to drafts)