BITMAP  Bitmap
There is given a rectangular bitmap of size n*m. Each pixel of the bitmap is either white or black, but at least one is white. The pixel in ith line and jth column is called the pixel (i,j). The distance between two pixels p_{1}=(i_{1},j_{1}) and p_{2}=(i_{2},j_{2}) is defined as:
Task
Write a program which:
 reads the description of the bitmap from the standard input,
 for each pixel, computes the distance to the nearest white pixel,
 writes the results to the standard output.
Input
The number of test cases t is in the first line of input, then t test cases follow separated by an empty line. In the first line of each test case there is a pair of integer numbers n, m separated by a single space, 1<=n <=182, 1<=m<=182. In each of the following n lines of the test case exactly one zeroone word of length m, the description of one line of the bitmap, is written. On the jth position in the line (i+1), 1 <= i <= n, 1 <= j <= m, is '1' if, and only if the pixel (i,j) is white.
Output
In the ith line for each test case, 1<=i<=n, there should be written m integers f(i,1),...,f(i,m) separated by single spaces, where f(i,j) is the distance from the pixel (i,j) to the nearest white pixel.
Example
Sample input: 1 3 4 0001 0011 0110 Sample output: 3 2 1 0 2 1 0 0 1 0 0 1
hide comments
Dushyant Singh:
20160726 13:35:27
Weird. Declaring 2D char array inside main gives RE and declaring it globally gives AC. o_O


sonali9696:
20160719 17:03:35
My first bfs question ^_^ 

SANDEEP KUMAR:
20160714 05:34:47
cakewalk, totally flooded it... 

iharsh234:
20160709 21:52:18
with simple bfs AC modifies code a bit series of RE comes _/\_ Last edit: 20160709 21:53:48 

Deepak :
20160704 13:44:51
finally AC after a TLE...now in 0.08!! 

baadshah_:
20160626 16:09:28
USE BFS AC in 1 GO(0.06s) 

aboalmanal2000:
20160623 09:41:39
My Second BFS =D 

man:
20160429 21:43:28
solved in execution time 3.69.. god knows how the top solution execution's time is 0.00 .. crazy..


Akshay Damle:
20160428 23:13:55
Code ran in 1 go on my system w/o any debugging and then AC in 1 go :D Feels great! 

satoruu:
20160427 17:44:09
AC using brute force!! 3.07 secs :) 
Added by:  Piotr Ćowiec 
Date:  20040913 
Time limit:  4s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  6th Polish Olympiad in Informatics, stage 2 