It’s been long enough since May Lunchtime and the editorial of Interactive MST is still missing. So I want to know what exactly the problem is about.
First of all if someone could please explain the statement a bit.
I get the part that there is a hidden permutation of edges and the queries structure. I am also familiar of the fact that in a graph with pairwise distinct edge weights, a unique MST is possible.
But what is the approach to solve it? I messed up big times on this problem. Someone help me out with a little explanation please.