[백준/BOJ] 백준 코딩 알고리즘 1018번/C++

백준 코딩 알고리즘 문제 1018번

 

백준 코딩 알고리즘 문제 1018번 풀이 - 사용 언어: C++

#include <iostream>
#include <string>
#include <algorithm>
 
#define MAX_SIZE 50
 
using namespace std;
 
string WHITE_FIRST[8] = {
    "WBWBWBWB",
    "BWBWBWBW",
    "WBWBWBWB",
    "BWBWBWBW",
    "WBWBWBWB",
    "BWBWBWBW",
    "WBWBWBWB",
    "BWBWBWBW"
};
 
string BLACK_FIRST[8] = {
    "BWBWBWBW",
    "WBWBWBWB",
    "BWBWBWBW",
    "WBWBWBWB",
    "BWBWBWBW",
    "WBWBWBWB",
    "BWBWBWBW",
    "WBWBWBWB"
};
 
string BOARD[MAX_SIZE];
int N, M;
 
int changeWhiteStart(int hor_s, int ver_s) {
 
    int count = 0;
 
    for (int i = ver_s; i < ver_s + 8; i++) {
        for (int j = hor_s; j < hor_s + 8; j++) {
            if (BOARD[i][j] != WHITE_FIRST[i - ver_s][j - hor_s]) {
                count++;
            }
        }
    }
 
    return count;
    
}
 
int changeBlackStart(int hor_s, int ver_s) {
 
    int count = 0;
 
    for (int i = ver_s; i < ver_s + 8; i++) {
        for (int j = hor_s; j < hor_s + 8; j++) {
            if (BOARD[i][j] != BLACK_FIRST[i - ver_s][j - hor_s]) {
                count++;
            }
        }
    }
 
    return count;
 
}
 
int main() {
 
    int total_minimum = 100000;
 
    //N이 세로 높이 칸
    //M이 가로 길이 칸
    cin >> N >> M;
    
    //보드 초기화
    for (int i = 0; i < N; i++) {
        cin >> BOARD[i];
    }
 
    for (int i = 0; i + 7 < N; i++) {
        for (int j = 0; j + 7 < M; j++) {
            total_minimum = min(total_minimum, min(changeWhiteStart(j, i), changeBlackStart(j, i)));
        }
    }
 
    cout << total_minimum << endl;
 
    return 0;
 
}