Can someone help me with how I can remove TLE in this python code : 139519137 This is the same Algorithm but in C++ : 139524288 I guess O(nlogn) shouldn't be a TLE in python for n=1e5 Here is the Problem 1617C - Паприка и перестановка Thanks
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 154 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | pajenegod | 144 |
9 | orz | 144 |
Can someone help me with how I can remove TLE in this python code : 139519137 This is the same Algorithm but in C++ : 139524288 I guess O(nlogn) shouldn't be a TLE in python for n=1e5 Here is the Problem 1617C - Паприка и перестановка Thanks
Name |
---|
Bruh, check your python submission link, it's in C++. (though I didn't downvoted)
Also, it is a bit common for Python code to TLE when the time limit is very tight, which usually happens on higher problems of Div2 (like D, E ...). But, it's rare to happen on C.