/
590C.go
96 lines (90 loc) · 1.77 KB
/
590C.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
package main
import (
"bufio"
. "fmt"
"io"
)
// github.com/EndlessCheng/codeforces-go
type pair90 struct{ x, y int }
type deque90 struct{ l, r []pair90 }
func (q deque90) empty() bool { return len(q.l) == 0 && len(q.r) == 0 }
func (q *deque90) pushL(v pair90) { q.l = append(q.l, v) }
func (q *deque90) pushR(v pair90) { q.r = append(q.r, v) }
func (q *deque90) popL() (v pair90) {
if len(q.l) > 0 {
q.l, v = q.l[:len(q.l)-1], q.l[len(q.l)-1]
} else {
v, q.r = q.r[0], q.r[1:]
}
return
}
func CF590C(_r io.Reader, out io.Writer) {
in := bufio.NewReader(_r)
dir4 := []pair90{{-1, 0}, {1, 0}, {0, -1}, {0, 1}}
var n, m int
Fscan(in, &n, &m)
g := make([][]byte, n)
for i := range g {
Fscan(in, &g[i])
}
bfs := func(tp byte) [][]int {
dis := make([][]int, n)
for i := range dis {
dis[i] = make([]int, m)
for j := range dis[i] {
dis[i][j] = 1e8
}
}
q := &deque90{}
for i, r := range g {
for j, b := range r {
if b == tp {
dis[i][j] = 0
q.pushL(pair90{i, j})
}
}
}
for !q.empty() {
p := q.popL()
for _, d := range dir4 {
if x, y := p.x+d.x, p.y+d.y; 0 <= x && x < n && 0 <= y && y < m && g[x][y] != '#' {
d := 0
if g[x][y] == '.' {
d = 1
}
if newD := dis[p.x][p.y] + d; newD < dis[x][y] {
dis[x][y] = newD
if d == 0 {
q.pushL(pair90{x, y})
} else {
q.pushR(pair90{x, y})
}
}
}
}
}
return dis
}
d1 := bfs('1')
d2 := bfs('2')
d3 := bfs('3')
ans := int(1e7)
for i, r := range g {
for j, b := range r {
if b != '#' {
d := d1[i][j] + d2[i][j] + d3[i][j]
if b == '.' {
d -= 2
}
if d < ans {
ans = d
}
}
}
}
if ans == 1e7 {
ans = -1
}
Fprint(out, ans)
}
//func main() { CF590C(os.Stdin, os.Stdout) }