[CPP] Unordered Maps working slower than Ordered Maps

#	User	Rating
1	tourist	4009
2	jiangly	3831
3	Radewoosh	3646
4	jqdai0815	3620
4	Benq	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	gamegame	3386
10	ksun48	3373

#	User	Contrib.
1	cry	164
1	maomao90	164
3	Um_nik	163
4	atcoder_official	160
5	-is-this-fft-	158
6	awoo	157
7	adamant	156
8	TheScrasse	154
8	nor	154
10	Dominater069	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.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!