Please subscribe to the official Codeforces channel in Telegram via the link ×

How to solve this graph problem?

Revision en3, by thatsme123, 2021-09-21 12:00:32

This question was asked in OA of UBER on campus...

Given a weighted undirected graph with q queries for finding the shortest distance between source to destination.

Constraints: 1e5 for nodes and edges,

Weight of edges 10e9

Tags graph


  Rev. Lang. By When Δ Comment
en3 English thatsme123 2021-09-21 12:00:32 64
en2 English thatsme123 2021-09-21 11:59:37 52 Tiny change: 'Given a we' -> 'This question was asked in OA of UBER on campus...\nGiven a we'
en1 English thatsme123 2021-09-21 11:09:20 219 Initial revision (published)