-
Notifications
You must be signed in to change notification settings - Fork 0
/
P14502.go
148 lines (123 loc) · 2.41 KB
/
P14502.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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
// https://www.acmicpc.net/problem/14502
// Graph, BFS, DFS
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc *bufio.Scanner = bufio.NewScanner(os.Stdin)
var bw *bufio.Writer = bufio.NewWriter(os.Stdout)
var dy = [...]int{1, -1, 0, 0}
var dx = [...]int{0, 0, 1, -1}
var N, M, max int
var Facil, visited [][]int
type Wall struct {
Y int
X int
}
func Fn() {
N, M = scanInt(), scanInt()
Facil = make([][]int, N)
for i := 0; i < N; i++ {
Facil[i] = make([]int, M)
}
Init()
wallSlice := make([]Wall, 0)
for i := 0; i < N; i++ {
for j := 0; j < M; j++ {
v := scanInt()
if v == 0 {
wallSlice = append(wallSlice, Wall{Y: i, X: j})
}
Facil[i][j] = v
}
}
var wall1, wall2, wall3 Wall
for i := 0; i < len(wallSlice)-2; i++ {
wall1 = wallSlice[i]
for j := i + 1; j < len(wallSlice)-1; j++ {
wall2 = wallSlice[j]
for k := j + 1; k < len(wallSlice); k++ {
wall3 = wallSlice[k]
facil := copy(Facil)
Init()
facil[wall1.Y][wall1.X] = 1
facil[wall2.Y][wall2.X] = 1
facil[wall3.Y][wall3.X] = 1
for row := 0; row < N; row++ {
for col := 0; col < M; col++ {
if facil[row][col] == 2 && visited[row][col] == 0 {
DFS(facil, row, col)
}
}
}
safeArea := calcSafeArea(facil)
if max < safeArea {
max = safeArea
}
facil[wall1.Y][wall1.X] = 0
facil[wall2.Y][wall2.X] = 0
facil[wall3.Y][wall3.X] = 0
}
}
}
fmt.Println(max)
}
func DFS(facil [][]int, row, col int) {
facil[row][col] = 2
visited[row][col] = 1
for i := 0; i < 4; i++ {
nRow := row + dy[i]
nCol := col + dx[i]
if nRow < 0 || nRow >= N || nCol < 0 || nCol >= M {
continue
}
if visited[nRow][nCol] == 1 {
continue
}
if facil[nRow][nCol] == 0 {
DFS(facil, nRow, nCol)
}
}
}
func copy(Facil [][]int) [][]int {
copier := make([][]int, N)
for i := 0; i < N; i++ {
copier[i] = make([]int, M)
}
for i := 0; i < N; i++ {
for j := 0; j < M; j++ {
copier[i][j] = Facil[i][j]
}
}
return copier
}
func calcSafeArea(facil [][]int) int {
safeArea := 0
for i := 0; i < N; i++ {
for j := 0; j < M; j++ {
if facil[i][j] == 0 {
safeArea++
}
}
}
return safeArea
}
func Init() {
visited = make([][]int, N)
for i := 0; i < N; i++ {
visited[i] = make([]int, M)
}
}
func main() {
defer bw.Flush()
sc.Split(bufio.ScanWords)
Fn()
}
func scanInt() int {
sc.Scan()
v, _ := strconv.Atoi(sc.Text())
return v
}