| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
|
0
set the dp value of # cells to 0 compute prefix sums on this dp and to get sum in range in same row u can move d to the left and d to the right at most in previous row u can can move sqrt(d^2 — 1) to the left or to the right cuz of euclidean dist |
|
0
prefix sum on current and previous row |
|
0
really good problems fun F |
|
0
very fun and interesting round i loved b and c in particular, codeforces just doesn't get better than this |
|
0
what if i want to set it higher |
|
0
Could you make it possible set a min or max rating bound on the potd |
|
0
I got hella lucky I didn’t realize only like 700 people ac’d this Gj on ac bro |
|
-9
wtf are these problems and why so many people wa on b |
|
+9
this contest is so trash B is shit C is weird D is free bad contest |
|
-10
D why |
|
0
E is 5 times harder than F |
| Name |
|---|


