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://mirror.codeforces.com/submissions/tanvir942316
→ Reply
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 23:07:59 (k1).
Desktop version, switch to mobile version.
Supported by
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.