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
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
6 | adamant | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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
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_map
which 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
.