Hello guys!

In yesterday's round Codeforces Round 617 (Div. 3), in question 1296C - Очередной идущий робот, I submitted this solution using map which took 61ms to pass: 70273184. Today, just out of curiosity, I thought of submitting the same solution using unordered map, which I later found out doesn't have a hash function for pairs, so I copied the hash function from GeeksForGeeks and then submitted the solution which took 187ms to pass: 70355416.

Can somebody tell me why is unordered map working slower than map for this problem ?

Thanks.