[CPP] Unordered Maps working slower than Ordered Maps

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

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.me/contest/1234/problem/B2

Solution using Unordered Maps: https://codeforces.me/contest/1234/submission/104445196

Solution using Ordered Maps: https://codeforces.me/contest/1234/submission/104445219

The same problem was observed in the following question as well:

Problem Link: https://codeforces.me/contest/808/problem/D

Solution using Unordered Maps: https://codeforces.me/contest/808/submission/101908196

Solution using Ordered Maps: https://codeforces.me/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!