| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 173 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
https://codeforces.com/contest/808/problem/D
unordered_map took me to tle but map took me to ac.
unordered_map submission https://codeforces.com/contest/808/submission/48371065
map submission https://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://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.