solution link: https://ideone.com/Dn2nQN problem link : https://codeforces.me/problemset/problem/1234/B2 Why it is giving tle at 23rd case?
→ Pay attention
Before contest
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
2 days
Register now »
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
2 days
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/15/2026 08:23:11 (g2).
Desktop version, switch to mobile version.
Supported by
Most likely it is because you are using an unordered map. Some tests are made specifically to mess with that container. Try using a map instead.
Yeah it worked thanks ! but why was it not working with unordered map. they are faster right?
Unordered maps are faster? Can you tell me why this is so in the first place?
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
Are you sure operations in Unordered Map takes O(1)?
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
Read this: https://en.m.wikipedia.org/wiki/Hash_table
And share this with every programmer who programs without reading the manual.
In average case its O(1) atleast read what you are sending
On average != Worst case. Read again.
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?
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
You just contradicted yourself and answered your original question yourself.
using ump is better than map right?
You cannot generalize stuff this way. One obvious example, how do you get the minimum/maximum element in the hash table efficiently?
ok i got your point thanks
If you want more information on unordered_map and how to make it faster: https://codeforces.me/blog/entry/62393
okk thank you!
Unordered map can have a high complexity when it is used a lot of times.
ohhkk