Why my solution of C is getting TLE. Can anyone tell me please? Isn't it supposed to pass?
Is this happening because of using map. Please help me. I have to know this.
https://codeforces.me/submissions/tanvir942316
→ Reply
| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 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 |
Why my solution of C is getting TLE. Can anyone tell me please? Isn't it supposed to pass?
Is this happening because of using map. Please help me. I have to know this.
https://codeforces.me/submissions/tanvir942316
→ Reply
| Name |
|---|



Yes. Using map will make your solution $$$O(n \cdot log^2 n)$$$.
Putting $$$n = 10^6$$$, number of operations = $$$4 \times 10^8$$$. You can use
std::unordered_mapwhich gives constant time insertion and accessing on average ($$$O(n)$$$ in worst case). Your solution with unordered_map 173282698.But it is possible to blow up unordered_map (to make access and insertion of order $$$O(n)$$$) by specific type of input. To prevent it you can use custom hash function.
Read this for more details: Blowing up unordered_map, and how to stop getting hacked on it
P.S: See how many people got hacked (see hacks made by beethoven97) because they used
std::unordered_map.