forked from b-chae/AlgorithmStudy
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path14502.cpp
More file actions
91 lines (79 loc) · 1.68 KB
/
Copy path14502.cpp
File metadata and controls
91 lines (79 loc) · 1.68 KB
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
#include <iostream>
#include <vector>
using namespace std;
int N, M;
int board[8][8];
int cpyboard[8][8];
bool visited[8][8];
void cpy_board() {
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cpyboard[i][j] = board[i][j];
visited[i][j] = false;
}
}
}
void dfs(int i, int j) {
visited[i][j] = true;
cpyboard[i][j] = 2;
if (i < N-1 && cpyboard[i + 1][j] == 0 && !visited[i + 1][j]) {
dfs(i + 1, j);
}
if (i > 0 && cpyboard[i - 1][j] == 0 && !visited[i - 1][j]) {
dfs(i - 1, j);
}
if (j > 0 && cpyboard[i][j - 1] == 0 && !visited[i][j - 1]) {
dfs(i, j - 1);
}
if (j < M-1 && cpyboard[i][j + 1] == 0 && !visited[i][j + 1]) {
dfs(i, j + 1);
}
}
int count0() {
int res = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
if (cpyboard[i][j] == 0) res += 1;
}
}
return res;
}
int main()
{
int i, j, k, l, m, n;
cin >> N >> M;
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
cin >> board[i][j];
}
}
int ans = 0;
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
for (k = i; k < N; k++) {
for (l = 0; l < M; l++) {
for (m = k; m < N; m++) {
for (n = 0; n < M; n++) {
if ((i != k || j != l) && (m != k || n != l) && (i != m || j != n) && board[i][j] == 0 && board[k][l] == 0 && board[m][n] == 0) {
cpy_board();
cpyboard[i][j] = 1;
cpyboard[k][l] = 1;
cpyboard[m][n] = 1;
for (int x = 0; x < N; x++) {
for (int y = 0; y < M; y++) {
if (cpyboard[x][y] == 2 && !visited[x][y]) {
dfs(x, y);
}
}
}
int tmp = count0();
if (tmp > ans) ans = tmp;
}
}
}
}
}
}
}
cout << ans;
}