Problem:
Score : 300 points

Problem Statement

You are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.
HW characters from A_{11} to A_{HW} represent the colors of the squares.
A_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.

We will repeatedly perform the following operation until all the squares are black:

Every white square that shares a side with a black square, becomes black.

Find the number of operations that will be performed.
The initial grid has at least one black square.

Constraints

1 \leq H,W \leq 1000

A_{ij} is # or ..

The given grid has at least one black square.

Input

Input is given from Standard Input in the following format:

H W
A_{11}A_{12}...A_{1W}
:
A_{H1}A_{H2}...A_{HW}

Output

Print the number of operations that will be performed.

Sample Input 1

3 3
...
.#.
...

Sample Output 1

2

After one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.

Sample Input 2

6 6
..#..#
......
#..#..
......
.#....
....#.

Sample Output 2

3

Solution in Go (1.6) (judge verdict: Wrong Answer)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 500001), 500000)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func main() {
	fp := os.Stdin
	if len(os.Args) > 1 {
		fp, _ = os.Open(os.Args[1])
	}

	scanner := getScanner(fp)

	writer := bufio.NewWriter(os.Stdout)

	r := getNextInt(scanner)
	c := getNextInt(scanner)
	n := r * c
	maze := make([]byte, n)
	steps := make([]int, n)
	queue := make([][2]int, n)
	ql := 0
	qr := 0
	for y := 0; y < r; y++ {
		s := getNextString(scanner)
		for x := 0; x < c; x++ {
			i := y*c + x
			maze[i] = s[x]
			if s[x] == '.' {
				continue
			}
			steps[i] = 1
			queue[qr][0] = i
			queue[qr][1] = 0
			qr++
		}
	}

	d := [4]int{-c, -1, 1, c}
	ans := -1
	for qr-ql > 0 {
		p := queue[ql]
		ql++
		ans = p[1]
		for i := 0; i < 4; i++ {
			ii := p[0] + d[i]
			if ii < 0 || ii >= n {
				continue
			}
			if ii/r != p[0]/r && ii%c != p[0]%c {
				continue
			}
			if maze[ii] == '#' {
				continue
			}
			if steps[ii] > 0 {
				continue
			}
			steps[ii] = 1
			queue[qr%n][0] = ii
			queue[qr%n][1] = p[1] + 1
			qr++
		}
	}

	fmt.Fprintln(writer, ans)

	writer.Flush()
}