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 - Paprika and Permutation Thanks
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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 - Paprika and Permutation 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.