Given a n * m matrix of 0s and 1s. For each square,find the sum of Manhattan distances from that square to the kth nearest 1s.
(Distance to closest 1 + distance to second closest 1 + ...)
n, m <= 2000
Thanks!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Sum of kth smallest distances.
Given a n * m matrix of 0s and 1s. For each square,find the sum of Manhattan distances from that square to the kth nearest 1s.
(Distance to closest 1 + distance to second closest 1 + ...)
n, m <= 2000
Thanks!
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en3 | Loserinlife | 2023-10-29 06:43:38 | 6 | Tiny change: 're to the kth neare' -> 're to the first kth neare' | ||
en2 | Loserinlife | 2023-10-29 06:43:08 | 58 | |||
en1 | Loserinlife | 2023-10-29 06:42:30 | 249 | Initial revision (published) |
Название |
---|