Recently i was giving a competition, specifically Codeforces round #647 div 2 and in the problem B (1362B - Johnny and His Hobbies), I thought the brute force approach would give TLE, as the complexity was O((n^2)logn) and combined with number of test cases it would give operations of nearly 10^10, which wont fit 1 second time. But at last i submitted the bruteforce and it passes the pretests. So, i just want to know if the number of test cases has any effect on the overall time complexity of the program. Thank you.