| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Problem with Codeforces C++ 11 compiler?
I've recently come across a very strange problem using C++ 11.
I submitted a solution for problem 620C - Жемчужинки using unordered_map and got TLE, then I submitted the exact same solution using map (it's supposed to be slower: O(1) amortized VS O(logN) per operation) and it got Accepted with 280 ms.
Submission with unordered_map: 15756653
Submission with map: 15759645
Is this some kind of problem with the C++11 compiler used here on Codeforces? Anyone got a clue?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
tenshi_kanade | 2016-02-03 02:24:40 | 1 | Tiny change: 'e slower: ($O(1)$ amo' -> 'e slower: $O(1)$ amo' | |
| en1 |
|
tenshi_kanade | 2016-02-03 02:23:54 | 552 | Initial revision (published) |
