-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathboj.1018.cc
62 lines (51 loc) · 1.5 KB
/
boj.1018.cc
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
#include <bits/stdc++.h>
using namespace std;
char board[50][50];
int check(int x, int y, char start)
{
char copy[8][8];
for (int i = 0; i < 8; ++i)
for (int l = 0; l < 8; ++l)
copy[i][l] = board[x + i][y + l];
int result = 0;
for (int i = 0; i < 8; ++i)
if (copy[i][i] != start)
copy[i][i] = start, result += 1;
for (int i = 1; i < 8; ++i)
for (int l = 0; l < i; ++l)
if (copy[i][l] == copy[i - 1][l])
{
// cout << endl
// << start << " " << i << " " << l;
result += 1, copy[i][l] = copy[i - 1][l] == 'W' ? 'B' : 'W';
}
for (int i = 1; i < 8; ++i)
for (int l = 0; l < i; ++l)
if (copy[l][i] == copy[l][i - 1])
{
// cout << endl
// << start << " " << l << " " << i;
result += 1, copy[l][i] = copy[l][i - 1] == 'W' ? 'B' : 'W';
}
// for (int i = 0; i < 8; ++i)
// {
// for (int l = 0; l < 8; ++l)
// cout << copy[i][l];
// cout << endl;
// }
return result;
}
int main(void)
{
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i)
for (int l = 0; l < m; ++l)
cin >> board[i][l];
int minimum = 0x7fffffff;
for (int i = 0; i < n - 7; ++i)
for (int l = 0; l < m - 7; ++l)
minimum = min(minimum, min(check(i, l, 'B'), check(i, l, 'W')));
cout << minimum;
return 0;
}