| # | 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 |
| # | 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 | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
+3
Faced same issue https://codeforces.me/contest/2236/submission/378437348 https://codeforces.me/contest/2236/submission/378437268 differnce between then is just one uses long long and one has int |
|
+2
In D There is no need to prove that u can say NO if number of problematic index is >4 U can take a big number like 1000 and solution will still pass eg: |
|
On
sammyuri →
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial, 5 months ago
0
Enjoyed the contest Couldn’t think of binary search on D :( |
|
+1
The way I checked was if high== low high-> largest element and low -> lowest element Then answer is done If high=low+1 and high is divisible by 2 the final value will be high( high=2 and low=1 is edge case handle separately ) Any other case just implementthe algo on high |
|
0
Just tried to brute force C and it passed Is that the optimal solution? |
|
0
Same |
|
+36
C2 has too big of a jump in difficulty |
|
0
Does D have a non brute force solution? |
