Sum of kth smallest distances.

Правка en2, от Loserinlife, 2023-10-29 06:43:08

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

k <= n * m

There are at least k ones in the matrix. 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)