| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
0
AIs have plans for Valentine's Day, so they won't participate in this round |
|
+30
Hello AI, where are U |
|
0
Will AI register? [doge] |
|
+13
We can imagine that one day when tourist is rushing to rating 4000, An AI called sorry_tourist comes and get rank 1st |
|
0
I wonder how many points for each peoblems Emmmm...5 problems make me scared |
|
0
Oh, i mean that you can start only 4 staircases at each free cell |
|
0
there is a solution for problem E notice that each staircase's length at most 2000 and each point have 4 staircases at most so U can use brute force to solve it the complexity will be $$$O(Q(N+M))$$$ |
|
0
In fact, the page was stucked in the first 1min in most of the rounds…… but this round was stucked too long, just like the cf round which was attacked by ddos in the past |
|
+35
Let me think : $$$ Div.3 \Leftarrow \Rightarrow Div.(1+2) $$$ so why not rated for someone whose rating is more than 1600 |
|
+1
1141A - Game 23 can be also solved using dfs. |
| Name |
|---|


