http://acm.timus.ru/problem.aspx?space=1&num=1613
Hi, i am trying to solve this problem using SQRT decomposition but i am getting TLE, how can it be optimized more or is my approach wrong.
Here is my code: https://ideone.com/tnuvKA
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 01:30:40 (f1).
Desktop version, switch to mobile version.
Supported by
I think you got TLE because you were doing binary search on each block. You can speed it up by using MO's Algorithm + Compression.
I know MO's algorithm but don't really know the compression part ?
Did you notice that the count of different number of X is at most (N + Q) ? Nah, just compress it into smaller number.
yeah i did and i think if i use map it would be the same problem like binary search so i need to count in an array. Right ?
Ya. :)
Thank you my friend for your help. Got it Accepted :)
You're welcome.