AtCoder Chokudai Contest 005 参戦記 - Qiita

package main import ( "bufio" "fmt" "math" "os" "strconv" ) func min(x, y int) int { if x < y { return x } return y } func fill(d [][]byte, i, j int, x, y byte) { q := [][2]int{{i, j}} for len(q) != 0 { m, n := q[0][0], q[0][1] q = q[1:] d[m][n] = x if m > 0 { if d[m-1][n] == y { q = append(q, [2]int{m - 1, n}) } } if m < N-1 { if d[m+1][n] == y { q = append(q, [2]int{m + 1, n}) } } if n > 0 { if