[백준 1018번] 체스판 다시 칠하기

소스코드

---

#include <iostream>
using namespace std;
 
int caseA[8][8], caseB[8][8], m, n, map[51][51], Min=987654321;
 
int cal(int x, int y) {
    int a = 0, b = 0;
    for (int i = x; i < x + 8; i++) {
        for (int j = y; j < y + 8; j++) {
            if (caseA[i-x][j-y] != map[i][j])
                a++;
            if (caseB[i-x][j-y] != map[i][j])
                b++;
        }
    }
    return a > b ? b : a;
}
 
int main() {
    for (int i = 0; i < 8; i++) {
        for (int j = 0; j < 8; j++) {
            if ((i + j) % 2) {
                caseA[i][j] = 1;
                caseB[i][j] = 0;
            }
            else {
                caseA[i][j] = 0;
                caseB[i][j] = 1;
            }
        }
    }
 
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            char a;
            cin >> a;
            if (a == 'W')
                map[i][j] = 0;
            else
                map[i][j] = 1;
        }
    }
 
    for (int i = 0; i < n - 7; i++) {
        for (int j = 0; j < m - 7; j++) {
            int ret = cal(i, j);
            if (ret < Min)
                Min = ret;
        }
    }
    cout << Min << '\n';
    return 0;
}