MST Queries

CodeChefRating 2871Open on judge ↗

For a given connected graph G with N vertices and M undirected weighted edges, the goal is to perform Q queries, each belonging to one of the below 3 types: - AssignZero(u, v) := Change the weight of edge between vertices u and v to zero. It is guaranteed there is an edge between vertex u and v in the graph G. - AssignOriginal(u, v) := Change the weight of edge between vertices u and v to its or

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI