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


Revision en2, by prodipdatta7, 2018-06-08 22:21:06

Given a graph of n nodes and m edges. The number of nodes and edges can have at most 100000. After adding each edge to the graph, you have to calculate the Minimum Spanning Tree of the current graph.

it is not any OJ problem. The problem idea has come to my mind but I can't figure out any solution except brute force. Is it possible to write a solution that will pass within 2s? I will be thankful to u if u share any idea related to the problem solution...

Tags graph, mst, query


  Rev. Lang. By When Δ Comment
en2 English prodipdatta7 2018-06-08 22:21:06 2 Tiny change: 's within 2 ms?\nI will' -> 's within 2s?\nI will'
en1 English prodipdatta7 2018-06-08 22:09:17 474 Initial revision (published)