| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
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.net/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.net/blog/entry/62393
Try this -> https://codeforces.net/blog/entry/62393
https://codeforces.net/contest/1642/submission/147545635
unordered_map is implemented using hash table because of hash collision it can take O(n) time in some cases