| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
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 - Pearls in a Row 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) |
