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
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
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
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.