Sum of kth smallest distances.

Revision en3, by Loserinlife, 2023-10-29 06:43:38

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!


  Rev. Lang. By When Δ Comment
en3 English Loserinlife 2023-10-29 06:43:38 6 Tiny change: 're to the kth neare' -> 're to the first kth neare'
en2 English Loserinlife 2023-10-29 06:43:08 58
en1 English Loserinlife 2023-10-29 06:42:30 249 Initial revision (published)