| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
This might help :) The search time for an unordered map is of O(n) in the worst case.
Thank you.
You can use gp_hash_table. I modified your solution and got AC in 2700ms.
Appreciate that.
I think that using gp_hash_table in the competition may also be hacked by others, especially div.3 or Educational Codeforces Round. In my opinion, when we solve the problem, if the time complexity of the prediction is sufficient, it is better to use a more stable algorithm.
In fact, I have the same experience as you. I was also hacked when I solved this problem, and then I realized the problem caused by using hash. QAQ
Blowing up unordered_map, and how to stop getting hacked on it