Description: Description Given a r* c 1 contains only two digits 0 and the matrix, the matrix for any point (x, y), define (x, y) the right of (x, y) to the Manhattan distance to this point Manhattan distance of a minimum (if mat [x] [y] = 1, then (x, y) the right of 0). Request a 01 matrix for a given weight of all the points and. Input The input contains multiple sets of data, each data first act two integers r, c (0 < r, c < = 1000). Then there are r rows c integers per line, and to ensure that only 0 or 1 (to ensure that the matrix contains at least one 1). Output For each test case, output an integer, the matrix of rights and each point.
To Search:
File list (Check if you may need any files):
jvzhen.c
Download