So I was doing this problem: https://mirror.codeforces.com/contest/1490/problem/F. And I got TLE when I use C++11: https://mirror.codeforces.com/contest/1490/submission/144339905 . and C++14: https://mirror.codeforces.com/contest/1490/submission/144338420 . but AC when using C++20: https://mirror.codeforces.com/contest/1490/submission/144339955 . Can anyone tell me why this is happening?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Auto comment: topic has been updated by pgiaminh8368 (previous revision, new revision, compare).
Change
unordered_maptomap. Time complexity ofunordered_mapon average isO(1)but it's worst case complexity isO(n)https://mirror.codeforces.com/contest/1490/submission/144341577
Thank you.
So that mean access element of a unordered_map is faster in C++20?
This is a problem from a Div3 contest, which means that this contest had a 12 hours hacking phase. And unordered_map is known to be vulnerable to adversarially constructed input data, which may hit the worst case time complexity. C++20 isn't better. It's just a newer complier, which probably changed its unordered_map implementation a little a bit. So the old hacks need to be adjusted to successfully target it too. See https://mirror.codeforces.com/blog/entry/62393
Thank you.