[BOJ] 백준 1018번: 체스판 다시 칠하기 (Java)

문제링크

https://www.acmicpc.net/problem/1018

1018번: 체스판 다시 칠하기

---

나의코드

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class Main{
    public static boolean[][] arr;
    public static int min = 64;
       
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine()," ");
        int N = Integer.parseInt(st.nextToken());
        int M = Integer.parseInt(st.nextToken());
        
        arr = new boolean[N][M];
        
        for(int i = 0; i < N; i++){
            String str = br.readLine();
            for(int j = 0; j < M; j++){
                if(str.charAt(j) == 'B'){
                    arr[i][j] = true;
                }else{
                    arr[i][j] = false;
                }
            }
        }
        
        int row = N - 7;
        int col = M - 7;
        
        for(int i = 0; i < row; i++){
            for(int j = 0; j < col; j++){
                calculate(i, j);
            }
        }
        
        System.out.print(min);
    }
    
    public static void calculate(int x, int y){
        int x_end = x + 8;
        int y_end = y + 8;
        int count = 0;
        
        Boolean BW = arr[x][y];
        
        for(int i = x; i < x_end; i++){
            for(int j = y; j < y_end; j++){
                if(arr[i][j] != BW){
                    count++;                    
                }
                BW = !BW;
            }
            BW = !BW;
        }
        count = Math.min(count, 64 - count);
        min = Math.min(count, min);
    }
}