Hi guys, As I got time from footaball I was practicing competitive coding. I was doing this problem from Gym contest.

ThisLink to problem.

I came to know that there is no way to see test cases in Gym contest.

I want to know What mistake I am making also I will appreciate any other solution.

This is my code which fails on second test. My approach is first run dijkstra from n'th city and find shortest path theough boat for each city. Then for each city we can choose between Average+k or its original shortest path. So I try to minimize the average and find minimum value for first vertex.