| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
Unofficial Editorial — Dilhan's Computing Contest 1 [Partial, P1~4 + P5S1]
Contest hosted on DMOJ https://dmoj.ca/contest/dcc1
If $$$a \gt b$$$, the answer is NO, as Alice always goes up and Bob always goes down. Otherwise, $$$a \leq b$$$, and the answer is YES if and only if the parity (oddness or evenness) of $$$a$$$ and $$$b$$$ is equal (equivalently, that $$$b - a$$$ is even). This is because the difference between them reduces by $$$2$$$ each step, and if the difference is odd, they'll end up on neighboring floors and then pass and miss each other on the next step.
Time complexity: $$$O(1)$$$
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en18 |
|
Spheniscine | 2025-03-09 06:54:08 | 2 | Tiny change: ' = 1}^{n} n^2 = \frac' -> ' = 1}^{n} i^2 = \frac' | |
| en17 |
|
Spheniscine | 2025-03-04 18:15:48 | 10 | ||
| en16 |
|
Spheniscine | 2025-03-04 18:12:49 | 90 | ||
| en15 |
|
Spheniscine | 2025-03-04 14:49:22 | 20 | Tiny change: 'i \neq -1$ (solving subtask 1), so what ' -> 'i \neq -1$, so what ' | |
| en14 |
|
Spheniscine | 2025-03-04 13:54:25 | 16 | ||
| en13 |
|
Spheniscine | 2025-03-04 13:45:22 | 125 | ||
| en12 |
|
Spheniscine | 2025-03-04 13:28:32 | 1 | Tiny change: 'of midlines and width' -> 'of midline and width' | |
| en11 |
|
Spheniscine | 2025-03-04 13:24:30 | 2 | Tiny change: 'rns out:\n- $d_{ne' -> 'rns out:\n\n- $d_{ne' | |
| en10 |
|
Spheniscine | 2025-03-04 13:23:48 | 4 | Tiny change: '- $d_{new}{1} = -\infty' -> '- $d_{new}[1] = -\infty' | |
| en9 |
|
Spheniscine | 2025-03-04 13:23:02 | 8 | Tiny change: '$d[l+1] \larr \min(d[l+' -> '$d[l+1] \leftarrow \min(d[l+' | |
| en8 |
|
Spheniscine | 2025-03-04 13:20:56 | 2887 | Tiny change: 'sible gap below $max_i a_i$' -> 'sible gap (if it exists) below $\max_i a_i$' (published) | |
| en7 |
|
Spheniscine | 2025-03-04 12:45:47 | 1142 | Tiny change: ' to add $\sum_{i = ' -> ' to add $\displaystyle \sum_{i = ' | |
| en6 |
|
Spheniscine | 2025-03-04 12:28:43 | 742 | Tiny change: ' case is $displaysty' -> ' case is $\displaysty' | |
| en5 |
|
Spheniscine | 2025-03-04 12:16:38 | 1103 | Tiny change: 'function $P(n) = \su' -> 'function $\displaystyle P(n) = \su' | |
| en4 |
|
Spheniscine | 2025-03-04 12:00:34 | 442 | ||
| en3 |
|
Spheniscine | 2025-03-04 03:41:43 | 4 | ||
| en2 |
|
Spheniscine | 2025-03-04 03:00:47 | 8354 | ||
| en1 |
|
Spheniscine | 2025-03-04 02:58:46 | 8060 | Initial revision (saved to drafts) |
| Name |
|---|


