The time complexity of your code is O(t*(nlogn + m*logm*logm)) (since every map access cost around O(logn) complexity).

if(md[c[i]]){
    md[c[i]]--;
    mc[c[i]]--;
    cnt--;
    c1=0;
}

So, when m tends to 2*10^5. your code performs around 5.6*10^6 operations per second and since, the time limit is 2s, your code just barely TLEs in this case.

You are using the map's read operation thrice in a loop which goes till M. Then you are using 2 map read operations in a loop which goes till N. Then you have another loop with NLogN complexity. So O(3NLogN + 3MLogM), for the N=M=2*10^5. You are doing close to 2.2 *10^7 operations, which might cause TLE.

I submitted your code but with only two different lines , defining endl to be ”\n" , and using the fastIO macro , and it passed Here's the submission 264177806

In general avoid using endl because it does flushing to the output stream which can cause TLE

This works in two simple ways.

1. Using FastIO. 2.Removing unused maps.

Thank you guys for responding.