Hello everyone!
Today I found a weird thing. I was solving problem C from Educational Codeforces Round 115. The link for the same is here. 1598C - Delete Two Elements I have solved this problem using map. The link to my solution using map is here: map solution But it was consuming more time. So I decided to reduce it. Then I realized that I actually do not want the ordered map. So, I have just replaced map with unordered_map. The link to my solution using unordered_map is here: unordered_map solution But surprisingly, I got TLE on test case 14. I don't know the reason behind this. Can anyone explain me why this happened?
Thank you :)
map guarantees the TC of O(log n) while unordered_map may go to O(n) for some inputs, and there are different ways to deal with that.
dfghjkolp;lkjhgfghju
this
Okay. So, this is what I was looking for. Thank you Lord_David
No problem