| # | 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 | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
|
0
is it just me or the contest was too tough >:c |
|
+1
Sorry bro, but i feel like more structure and algos also force you to think intuitively. But i get your point, its just the way i see how to approach stuff, im not some genius who gets a habit of solving these adhocs on a habit |
|
+1
ad-hocforces |
|
On
__baozii__ →
Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial, 2 months ago
+3
Damn D was graph?? never even thought of thinking graph for this. |
|
0
man, what even was the approach for D? I cant even think of some kind of approach for it |
|
0
why do you have so many compilation error submits? I get sometimes it can happen but man, running the code atleast once before submitting should be done, I get sometimes mishaps can happen while submitting but you have a unusual amount of compilation errors. not to mention I saw a first submission to a question being compilation error not due to half pastes or anything but a typo in return and some other overloaded stuff, I am sure these stuff could have been avoided if you actually ran the code? |
|
0
honestly C isnt a hard question by any means, im sure simulating the testcase is enough to get the intuition for it, but still implementation wise I dont expect much people to solve graphs, and seeing my rating dropped much lower than it normal does around the same rank im guessing a lot of lower rated people were able to solve it, this prob means there might have been more cheating involved here |
|
0
Thanks for the problems. It was one of the most fun Div. 2 rounds in quite some time. |
|
0
for h=1 and v=1 only one guild will be there {2,3,4}. there is only one guild if you fix both v and h. |
|
+17
such a fun contest after a long time honestly |
| Name |
|---|


