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 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
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 |
---|