-
Notifications
You must be signed in to change notification settings - Fork 0
/
P17086.go
92 lines (78 loc) · 1.38 KB
/
P17086.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
// BruteForce
// https://www.acmicpc.net/problem/17086
package main
import (
"bufio"
"fmt"
"math"
"os"
"strconv"
)
var sc *bufio.Scanner = bufio.NewScanner(os.Stdin)
var bw *bufio.Writer = bufio.NewWriter(os.Stdout)
var N, M int
type Shark struct {
Row int
Col int
}
func main() {
defer bw.Flush()
sc.Split(bufio.ScanWords)
N, M = scanInt(), scanInt()
Space := make([][]int, N)
for i := 0; i < N; i++ {
Space[i] = make([]int, M)
}
sharkSlice := make([]Shark, 0)
for row := 0; row < N; row++ {
for col := 0; col < M; col++ {
v := scanInt()
if v == 1 {
sharkSlice = append(sharkSlice, Shark{Row: row, Col: col})
} else {
Space[row][col] = math.MaxInt
}
}
}
for row := 0; row < N; row++ {
for col := 0; col < M; col++ {
if Space[row][col] == math.MaxInt {
for i := 0; i < len(sharkSlice); i++ {
Space[row][col] = Min(Space[row][col], (Max(Abs(row-sharkSlice[i].Row), Abs(col-sharkSlice[i].Col))))
}
}
}
}
max := 0
for row := 0; row < N; row++ {
for col := 0; col < M; col++ {
if Space[row][col] > max {
max = Space[row][col]
}
}
}
fmt.Fprintln(bw, max)
}
func Max(a, b int) int {
if a < b {
return b
}
return a
}
func Min(a, b int) int {
if a < b {
return a
}
return b
}
func Abs(a int) int {
if a >= 0 {
return a
}
return -a
}
func scanInt() int {
sc.Scan()
v, _ := strconv.Atoi(sc.Text())
return v
}