1426C - Increase and Copy this is the problem and below is the link to my code- https://codeforces.com/problemset/submission/1426/146922562 can anyone explain why I am getting TLE in test case 3? is it because of the timecomplexity O(sqrt(n)logn) or something else?
Yep, you're right. The time complexity is: O(T * sqrt(N) * log(N)), which leads to TLE.