I have been doing Graphs from CSES Problem set and unfortunately got stuck in SHORTEST PATH — 1 Problem. I'm getting WA in 6th , 7th , 8th , 9th and 12th TestCase. Though I have used long long int then also , its giving WA . If you have got AC, then please help me out....
So, here's the problem that I've came up with: Given a undirected weighted graph, consisting of n vertices and m edges. The task is to find all the edges that are a part of every shortest path from vertex 1 to vertex n. In another word, find all the edges that if we delete it...