| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
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) |
