MST Queries

CodeChefOpen on judge ↗

You are given an undirected connected graph with *n* vertices and *m* edges numbered from 1 to *m*. You have to apply Kruskal's algorithm for finding the Minimum Spanning Tree in G. Every second you add 1 edge to the spanning tree and thus complete the process in *n* - 1 seconds. Initially at **t=0** there is **no edge** in the tree. You are given *Q* queries each having a time *t*. Your task it t

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