| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 151 |
Given a n * m matrix of 0s and 1s. For each square,find the sum of Manhattan distances from that square to the first kth nearest 1s.
(Distance to closest 1 + distance to second closest 1 + ...)
n, m <= 2000
k <= n * m
There are at least k ones in the matrix. Thanks!
https://atcoder.jp/contests/abc233/tasks/abc233_h?fbclid=IwAR2FvFmPdn0ly71SBs5cYpRKmZSzmgFxtjpq_JVJHLpME48HhLJbQOJvwx0
I think it's a bit different because I want the sum of the first kth distances, not only the kth.
the idea is a bit similar, in order to calculate the sum of the first kth distance, we need to consider 4 cases to handle |x1 — x2| + |y1 — y2|.
(x1 > x2, y1 > y2)
(x1 < x2, y1 < y2)
(x1 > x2, y1 < y2)
(x1 < x2, y1 > y2)
we can see that we can divide the square into 4 seperate smaller squares to handle that.
Can you provide the source of this task? I think I have something quite close to solving the task but I need some research on it