№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
Unofficial Editorial — Back to School '24
Contest hosted on DMOJ https://dmoj.ca/contest/bts24
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en24 | Spheniscine | 2024-09-10 16:05:28 | 354 | Tiny change: 'find that answer.\n' -> 'find that one answer.\n' | ||
en23 | Spheniscine | 2024-09-10 10:29:37 | 251 | Tiny change: '1, p_2) + ... + c(p_m, ' -> '1, p_2) + \hellip + c(p_m, ' | ||
en22 | Spheniscine | 2024-09-10 08:56:35 | 108 | |||
en21 | Spheniscine | 2024-09-10 07:23:51 | 9 | Tiny change: 'e minimum index of a stud' -> 'e minimum position of a stud' | ||
en20 | Spheniscine | 2024-09-10 07:22:27 | 6 | Tiny change: 'm $f(l+1, k)$ to $f(l, k)$, we use' -> 'm $f(l+1, \*)$ to $f(l, \*)$, we use' | ||
en19 | Spheniscine | 2024-09-10 07:21:39 | 1 | Tiny change: 'rs for $f(*, k)$ whe' -> 'rs for $f(\*, k)$ whe' | ||
en18 | Spheniscine | 2024-09-10 07:20:59 | 2 | Tiny change: 'r $f(l+1, *)$ to $f(l, *)$. Let's' -> 'r $f(l+1, \*)$ to $f(l, \*)$. Let's' | ||
en17 | Spheniscine | 2024-09-10 07:20:30 | 4 | Tiny change: 'r $f(l+1, k)$ to $f(l, k)$. Let's ' -> 'r $f(l+1, *)$ to $f(l, *)$. Let's ' | ||
en16 | Spheniscine | 2024-09-10 06:25:12 | 2 | Tiny change: '_i \leq A_i+1$, therefo' -> '_i \leq A_{i+1}$, therefo' | ||
en15 | Spheniscine | 2024-09-10 06:23:24 | 247 | |||
en14 | Spheniscine | 2024-09-10 05:48:11 | 51 | |||
en13 | Spheniscine | 2024-09-10 05:43:57 | 7 | Tiny change: ' going up or down f' -> ' going up toward or down f' | ||
en12 | Spheniscine | 2024-09-10 05:40:02 | 714 | (published) | ||
en11 | Spheniscine | 2024-09-10 05:27:46 | 957 | Tiny change: 'node $v$ (*without* consideri' -> 'node $v$ (''without'' consideri' | ||
en10 | Spheniscine | 2024-09-10 05:16:41 | 2 | Tiny change: ', or $\inf$ if there' -> ', or $\infty$ if there' | ||
en9 | Spheniscine | 2024-09-10 05:15:08 | 3 | Tiny change: 'N\sqrt Q)$\n</spoile' -> 'N\sqrt Q)$.\n</spoile' | ||
en8 | Spheniscine | 2024-09-10 05:14:51 | 1419 | Tiny change: ' + QN / X). By picki' -> ' + QN / X)$. By picki' | ||
en7 | Spheniscine | 2024-09-10 04:58:52 | 1007 | Tiny change: '$R_{i, j} > R_{i+1, j' -> '$R_{i, j} < R_{i+1, j' | ||
en6 | Spheniscine | 2024-09-10 04:43:55 | 438 | Tiny change: ' becomes\n```\n3 4' -> ' becomes\n\n```\n3 4' | ||
en5 | Spheniscine | 2024-09-10 04:36:42 | 703 | |||
en4 | Spheniscine | 2024-09-10 04:29:00 | 359 | |||
en3 | Spheniscine | 2024-09-10 04:27:25 | 1255 | Tiny change: 'arepsilon$) of the $' -> 'arepsilon$, to preserve tiebreaking order) of the $' | ||
en2 | Spheniscine | 2024-09-10 04:08:57 | 345 | |||
en1 | Spheniscine | 2024-09-10 04:04:11 | 126 | Initial revision (saved to drafts) |
Название |
---|