# | User | Rating |
---|---|---|
1 | tourist | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
8 | luogu_official | 150 |
10 | awoo | 148 |
Unofficial Editorial — Dilhan's Computing Contest 1 [Partial, P1~4 + P5S1]
Contest hosted on DMOJ https://dmoj.ca/contest/dcc1
You can solve each row independently of each other. Using window sums, you can count the number of A
or B
in any contiguous section of $$$K$$$ cells, and thus detect whether any player has an opposing player in front of them.
Time complexity: $$$O(NM)$$$
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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 |
---|