From b5fd68d5c45ab2c378b55c68a5eed64558958b0e Mon Sep 17 00:00:00 2001 From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com> Date: Sat, 28 Feb 2026 14:17:22 +0900 Subject: [PATCH] =?UTF-8?q?[20260228]=20BOJ=20/=20G4=20/=20=EC=B2=B4?= =?UTF-8?q?=EC=8A=A4=ED=8C=90=20=EB=8B=A4=EC=8B=9C=20=EC=B9=A0=ED=95=98?= =?UTF-8?q?=EA=B8=B0=202=20/=20=EC=9D=B4=EC=A4=80=ED=9D=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...\354\271\240\355\225\230\352\270\260 2.md" | 54 +++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 "JHLEE325/202602/28 BOJ G4 \354\262\264\354\212\244\355\214\220 \353\213\244\354\213\234 \354\271\240\355\225\230\352\270\260 2.md" diff --git "a/JHLEE325/202602/28 BOJ G4 \354\262\264\354\212\244\355\214\220 \353\213\244\354\213\234 \354\271\240\355\225\230\352\270\260 2.md" "b/JHLEE325/202602/28 BOJ G4 \354\262\264\354\212\244\355\214\220 \353\213\244\354\213\234 \354\271\240\355\225\230\352\270\260 2.md" new file mode 100644 index 00000000..b23df43e --- /dev/null +++ "b/JHLEE325/202602/28 BOJ G4 \354\262\264\354\212\244\355\214\220 \353\213\244\354\213\234 \354\271\240\355\225\230\352\270\260 2.md" @@ -0,0 +1,54 @@ +```java +import java.io.*; +import java.util.*; + +public class Main { + static int N, M, K; + static char[][] board; + + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + + N = Integer.parseInt(st.nextToken()); + M = Integer.parseInt(st.nextToken()); + K = Integer.parseInt(st.nextToken()); + + board = new char[N + 1][M + 1]; + for (int i = 1; i <= N; i++) { + String line = br.readLine(); + for (int j = 1; j <= M; j++) { + board[i][j] = line.charAt(j - 1); + } + } + + System.out.println(Math.min(coloring('B'), coloring('W'))); + } + + static int coloring(char start) { + int[][] sum = new int[N + 1][M + 1]; + + for (int i = 1; i <= N; i++) { + for (int j = 1; j <= M; j++) { + int value = 0; + if ((i + j) % 2 == 0) { + if (board[i][j] != start) value = 1; + } else { + if (board[i][j] == start) value = 1; + } + + sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + value; + } + } + + int painting = Integer.MAX_VALUE; + for (int i = K; i <= N; i++) { + for (int j = K; j <= M; j++) { + int count = sum[i][j] - sum[i - K][j] - sum[i][j - K] + sum[i - K][j - K]; + painting = Math.min(painting, count); + } + } + return painting; + } +} +```