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 i-th line and j-th column is called the pixel (i,j). The distance between two pixels p1=(i1,j1) and p2=(i2,j2) is defined as:
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.
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 zero-one word of length m, the description of one line of the bitmap, is written. On the j-th position in the line (i+1), 1 <= i <= n, 1 <= j <= m, is '1' if, and only if the pixel (i,j) is white.
In the i-th 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.
Sample input: 1 3 4 0001 0011 0110 Sample output: 3 2 1 0 2 1 0 0 1 0 0 1
|Added by:||Piotr Łowiec|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: SCM chicken|
|Resource:||6th Polish Olympiad in Informatics, stage 2|
" but at least one is white "
What if there are no white pixels in the bitmap, what should I print?
you just need one word to understand the ques: minesweeperLast edit: 2015-01-27 13:12:46
getting sigxfsz runtime error .....somebody plz help
Arafat dad Khan:
A brilliant problem with a brilliant solution--- Absolutely loved it
Exactly @ Master_Card
Is anybody have old Pyramid best timings ? I don't remember my own best time. I think there were several near 0.01s too with Pyramid.
hw can one solve this in 0.0 , _/\_
Very good question!!