I was trying to hack (my own solution) of DSU step 3 problem A and it got Unexpected verdict.

My Generator (spoilers are broken, so I am using pastebin)

I first searched it on google and found this blog, which says unexpected verdict means problems with authors solution. I hope this will get fixed (mentioning Aksenov239 for that).

Confusion about the constraint:

constraints for $$$n$$$ and $$$m$$$ is $$$\leq 2 \cdot 10^5$$$ in this problem. If I take $$$n = 10^5$$$, $$$m = 2\cdot10^5$$$ and in the first $$$\frac{n}{2}$$$ queries I connect the first $$$\frac{n}{2}$$$ sets and in the last $$$\frac{n}{2}$$$ I connect the last $$$\frac{n}{2}$$$ sets, then connecting $$$\frac{n}{2}$$$ and $$$\frac{n}{2}+1$$$ should take $$$\frac{n}{2}$$$ time. If I keep connecting $$$\frac{n}{2}$$$ and $$$\frac{n}{2} + 1$$$ and rollbacking for the rest of the queries then the time complexity should become $$$\frac{n^2}{4}$$$ and it should get TLE.

If there is a way to solve this please share that. (Cause I don't know how to do that >_< )