-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path10102.go
63 lines (56 loc) · 1 KB
/
10102.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
// UVa 10102 - The path in the colored field
package main
import (
"fmt"
"math"
"os"
"sort"
)
func abs(i int) int {
if i < 0 {
return -i
}
return i
}
func manhattanDistance(i, j int, grid [][]byte) int {
minDistance := math.MaxInt32
for x, vx := range grid {
for y, vy := range vx {
if vy == '3' {
minDistance = min(minDistance, abs(i-x)+abs(j-y))
}
}
}
return minDistance
}
func solve(grid [][]byte) int {
var mins []int
for x, vx := range grid {
for y, vy := range vx {
if vy == '1' {
mins = append(mins, manhattanDistance(x, y, grid))
}
}
}
sort.Sort(sort.Reverse(sort.IntSlice(mins)))
return mins[0]
}
func main() {
in, _ := os.Open("10102.in")
defer in.Close()
out, _ := os.Create("10102.out")
defer out.Close()
var m int
var row string
for {
if _, err := fmt.Fscanf(in, "%d", &m); err != nil {
break
}
grid := make([][]byte, m)
for i := range grid {
fmt.Fscanf(in, "%s", &row)
grid[i] = []byte(row)
}
fmt.Fprintln(out, solve(grid))
}
}