My solution (submission link) is getting the time limit exceeded while on test case 34 while being virtually identical to the editorial solution. I tried a bunch of changes but non seem to be working
My solution (submission link) is getting the time limit exceeded while on test case 34 while being virtually identical to the editorial solution. I tried a bunch of changes but non seem to be working
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 8 | nik_exists | 131 |
| 10 | Proof_by_QED | 130 |
Use map instead of unordered_map
Thank you that worked, but I dont understand why that would work. Isnt the complexity of map more than unordered_map?
https://codeforces.me/blog/entry/62393
It might be because of overflow in the binary search(the max value is 5e9, and 5e9*5e9 = 25e18, which will overflow beyond even unsigned long long). I suggest changing it to 3e9, which is enough and will not overflow.
use map
Use map instead of unordered_map