Guys my code is continuously getting TLE on Test case 6. Can someone pls help find the bug? link to my code : https://mirror.codeforces.com/contest/1354/submission/80872965
# | 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 | 151 |
Guys my code is continuously getting TLE on Test case 6. Can someone pls help find the bug? link to my code : https://mirror.codeforces.com/contest/1354/submission/80872965
Name |
---|
I think this is due to the fact that maybe the time complexity of your code is nlog^2q. Question requires it to be nlogq.
Try using fast i/o. I have also used similar approach and just using fast i/o might do it.
I tried same approach with segment trees and it failed :(
Yes, fenwick tree/BIT is faster than segment tree due to segment tree operations having larger constant factor. This question does have n,q = 1e6, and even BIT passes with around ~ 1s.