I submitted this to 527C: h[submission:167938194]
I'm sure that it's O(nlogn) ($$$n \leq 2 \times 10^5$$$), and I TLEed on 7.
Please help me!
→ Pay attention
Before contest
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
29:00:33
Register now »
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
29:00:33
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 | 142 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Hello,I'm a 10-years-old student from China.I like CodeForces! I like to write code with C++ and Java. Eric
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/16/2026 12:34:27 (g2).
Desktop version, switch to mobile version.
Supported by
