Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 days
Register now »
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 days
Register now »
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
0
Problem F — Equalize the Array "you can consider only unique values of C (there are no more than O(n*√n)), and get a solution in O(n*√n)" I used this approach mentioned in the editorial during the contest and get a TLE in test case 12. Here is my submission:107609642 |
|
0
Problem F — Equalize the Array "you can consider only unique values of C (there are no more than O(n*√n)), and get a solution in O(n*√n)" I used this approach mentioned in the editorial during the contest and get a TLE in test case 12. Here is my submission:107609642 |
|
0
I expected the editorial to explain the proof for problem C-Div2, but it just shows the steps to solve. Could anyone explain why the binary search solution is always true? |
|
+2
could you please mention the duration and the approximate number of problems in each div? |
