Can someone please tell me why this submission 90262228 of 0-1 MST problem (1243D - 0-1 MST) is giving runtime error on test #25? Thanks
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 145 |
9 | pajenegod | 145 |
Can someone please tell me why this submission 90262228 of 0-1 MST problem (1243D - 0-1 MST) is giving runtime error on test #25? Thanks
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.
Name |
---|