https://codeforces.me/contest/2149/submission/340722817 this is my submission it is failing by TLE on testcase 15. I don't understand why. I have implemented the same approach as given in the editorial. I compress the values of array A and the do 50 tries of randomly checking if count of some value in [L, R] > (r — l + 1)/3.
Any help will be appreciated. Thanks
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
The reason of TLE is big constant behind your solution.
If you improve line 54 of your solution from $$$O(\log(n))$$$ to $$$O(1)$$$, you will get AC: 340741082
From 4.5s+ to 1.9s.
Thanks a lot.