Please read the new rule regarding the restriction on the use of AI tools. ×

Asked in Beaconstac Winter Internship Challenge 2022

Revision en2, by __Serendipity, 2022-11-12 15:11:50

Given an undirected weighted graph G, with N nodes and E edges. You have to answer Q queries.

In each query, you are given two nodes u and v. The answer to the query is the minimum value k such that there is a path from node u to node v such that the maximum weight of the edge in path is at most k.

Constraints : N,E,Q <= 10^5

Can anyone please explain me how to solve this problem!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English __Serendipity 2022-11-12 15:11:50 61
en1 English __Serendipity 2022-11-11 19:33:16 476 Initial revision (published)