Guys my code is continuously getting TLE on Test case 6. Can someone pls help find the bug? link to my code : https://codeforces.com/contest/1354/submission/80872965
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
5 | atcoder_official | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Guys my code is continuously getting TLE on Test case 6. Can someone pls help find the bug? link to my code : https://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.