I've recently come across a very strange problem using C++ 11.↵
↵
I submitted a solution for problem [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(_{log}N)$ per operation) and it got Accepted with 280 ms.↵
↵
Submission with unordered_map: [submission:15756653]↵
↵
Submission with map: [submission:15759645]↵
↵
Is this some kind of problem with the C++11 compiler used here on Codeforces? Anyone got a clue?
↵
I submitted a solution for problem [problem:620C] using unordered_map and got TLE, then I submitted the exact same solution using map (it's supposed to be slower:
↵
Submission with unordered_map: [submission:15756653]↵
↵
Submission with map: [submission:15759645]↵
↵
Is this some kind of problem with the C++11 compiler used here on Codeforces? Anyone got a clue?