[JAVA] 백준 - 1018번: 체스판 다시 칠하기 | 브루트포스 알고리즘

1018번: 체스판 다시 칠하기 (acmicpc.net)

1018번: 체스판 다시 칠하기

 

import java.util.*;
import static java.lang.Math.min;

public class Main {
    public static void main(String[] args) {
       Scanner input = new Scanner(System.in);
       int n = input.nextInt();
       int m = input.nextInt();

       boolean[][] brd = new boolean[n][m];
       for (int i=0; i<n; i++) {
           String str = input.next();
           for (int j=0; j<m; j++) {
               if (str.charAt(j) == 'W') brd[i][j] = true;
               else brd[i][j] = false;
           }
       }

        int ans = 64;
        for (int i = 0; i<=n-8; i++) {
           for (int j = 0; j<=m-8; j++){

               int cnt = 0;
               boolean TF = brd[i][j];
               for (int i8 = i; i8 < i+8; i8++){
                   for (int j8 = j; j8 < j+8; j8++){
                        if (TF != brd[i8][j8]) cnt++;
                        TF = !TF;
                   }
                   TF = !TF;
               }
               ans = min(ans, cnt = min(cnt, 64-cnt));
           }

       }
        System.out.println(ans);
    }
}