Icpc trip graph problem

#1

send the link of this problem…

#2

hello @shampblocks
this problem is not there on the hackerblocks.
search on codechef ,most probably u will find it there.

#3

can you send the link of this problem??

#4

i dont have it, neither it is available on hackerblocks.

most of the ICPC rounds are conducted over codechef.
so search on codechef for this problem

#5

according to the solution in video what will be the time complexity of it??

#6

it will be same as dijkastras

#7

but we are doing dijektras two times and also we are finding x and y and we have to find the pair x and y isn’t it take +V^2 time??

#8

no .
after applying dijkastra twice,
we just have to traverse each edge (say u —v)
then using dijkastra table we will find
cost src…u + cost v…dest + cost u…v

#9

So it will be Vlog(E) +E??

#10

yeah …

#11

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.