| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
https://mirror.codeforces.com/contest/808/problem/D
unordered_map took me to tle but map took me to ac.
unordered_map submission https://mirror.codeforces.com/contest/808/submission/48371065
map submission https://mirror.codeforces.com/contest/808/submission/48371396
but we know generally unordered_map works in O(1) time where map works in O(log n) time. so, why this occurs. please.
Вроде как когда элементов много лучше работает unordered_map, если мало то просто map.. Или все наоборот,не помню, надо просто протестировать
https://mirror.codeforces.com/blog/entry/62393
Generally, if one already know the hash function(like the one in unordered_map) you use in your code, then one could make mean data to blow it up(if your hash function is not safe enough), while map(RBTree) is stable.