→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 154 |
| 7 | Dominater069 | 154 |
| 9 | awoo | 153 |
| 10 | luogu_official | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/26/2024 12:27:16 (i1).
Desktop version, switch to mobile version.
Supported by
your unordered_map got an anti-hash test(unordered_map worst case look time O(n) due to all hashes colliding with each other). And because MS C++ 2017 is a different compiler, so unordered map hashing works a bit different. In whatever way, the three should get timelimit anyways. I recommend you not to use unordered_map in hackable contests or in sites that have system testing afterwards like codeforces.
At least it could have given TLE at the time of contest so i would have changed the unordered_map to map.
Sadly, authors usually don't usually think of anti-hashing tests but hackers do. Here is a really cool blog which helps if you want to use unordered_map.
But here all keys are ints and not int64_t/long longs, so their hashes do not (should not?) collide, so what's the real reason?
Numbers till $$$10^9$$$. At least not all hashes collide, but a lot of them. If numbers were only till $$$10^6$$$ or lower, I guess it was gonna pass.
Yeah, I did not realize that the hash function includes % bucket_count, thank you