what is the time and space complexity of icpc trip problem.also provide the code.
Complexity issue
Hey @Rj.25
Here is the solution ICPC Trip - Interesting Graphs Problem!
Time complexity is complexity of dijkstra which is nlogn
Space complexity is n
If your doubt is resolved please mark it as closed.
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.