Comments
On Monogon → Codeforces Round #658, 6 years ago
+10

getting a hunch that this one is going to be one hell of a ride or maybe 567 is still haunting me who knows

+4

maverick16 thats why there is a div1 too. I think the problems were very interesting.

count me in too

On McDic → Codeforces Round #633, 7 years ago
+15

Will there be contest today considering the server problem?

ohhkk

ok i got your point thanks

yup but most of the times its O(1). i think this test case was made to avoid ump as lot of collisions is happening but still using ump is better than map right?

okk thank you!

In average case its O(1) atleast read what you are sending

i am just a beginner. i have studied o(1) for unordered map in general. can you please tell me why map wprking instead of ump

In map data is stored in sorted order while in unordered map it is not. operations like insert delete takes log n in map while o(1) in unordered

+3

Yeah it worked thanks ! but why was it not working with unordered map. they are faster right?

0

when will the ratings come?

+6

their slowest system testing in the history

0

great now stuck at 79!!

0

can you show the steps?

0

1 5 2 2 2 2 4 why this will give yes in A?

0

how?

+10

I cant see the code of others (it is almost 2hrs)

0

same