[CPP] Unordered Maps working slower than Ordered Maps

#	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	Dominater069	154
8	awoo	154
10	luogu_official	150

Hi All

I have been implementing the solution to the following problem. I first tried using Unordered Maps but the solution gave a TLE, however, when I submitted the same code using Ordered Maps, it got Accepted.

Problem Link: https://codeforces.net/contest/1234/problem/B2 Solution using Unordered Maps: https://codeforces.net/contest/1234/submission/104445196 Solution using Ordered Maps: https://codeforces.net/contest/1234/submission/104445219

The same problem was observed in the following question as well: Problem Link: https://codeforces.net/contest/808/problem/D Solution using Unordered Maps: https://codeforces.net/contest/808/submission/101908196 Solution using Ordered Maps: https://codeforces.net/contest/808/submission/101848962

In most of the theory, I went through, regarding Maps in CPP, it states that ordered maps are mostly slower than unordered maps as the lookup in unordered maps is O(1).

Does anyone have any clue as to what might be the coding error leading to such a deviation. Any help will be appreciated!

Thanks in advance!