| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
Here I'm doing searching work only.unordered_map<>takes O(1) for searching and map<>takes O(long) for searching so I didn't get that why I'm getting tle. Here is my code link -:
https://codeforces.com/contest/1642/submission/147498144
Above is my tle code.
first learn how to ask questions in blogs
Auto comment: topic has been updated by rinku11 (previous revision, new revision, compare).
https://www.geeksforgeeks.org/unordered_map-in-cpp-stl/
Read that it mentioned that it can go up to o(n*n)
#define boost() reserve(1024)#define fast() max_load_factor(0.25)you can use this template (credit goes to Arpa) too to speed up umap in main :
umap_name.fast();umap_name.boost();Still it can give TLE on some specific case na
with ref to this blog -> https://codeforces.com/blog/entry/62393
Try this -> https://codeforces.com/blog/entry/62393
https://codeforces.com/contest/1642/submission/147545635
unordered_map is implemented using hash table because of hash collision it can take O(n) time in some cases