Merge pull request #132 from AlgorithmWithGod/Seol-JY

[20250217] BOJ / 골드3 / 봄버맨2 / 설진영

Author: ShinHeeEul

Seol-JY/202502/17 G3 봄버맨 2.md

@@ -0,0 +1,104 @@
+```java
+import java.io.*;
+import java.util.StringTokenizer;
+
+public class Main {
+	static int R, C, N;
+	static int[][] map;
+	
+	public static void main(String[] args)throws IOException{
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+		R = Integer.parseInt(st.nextToken());
+		C = Integer.parseInt(st.nextToken());
+		N = Integer.parseInt(st.nextToken());
+		
+		map = new int[R+2][C+2];
+		for (int i = 1; i <= R; i++) {
+			String userInput = br.readLine();
+			for (int j = 1; j <= C; j++) {
+				char ipt = userInput.charAt(j -1);
+				if (ipt == '.') map[i][j] = 0;
+				else map[i][j] = 1;
+			}
+		}
+		
+		if (N % 2 == 0) {
+			for (int i = 1; i <= R; i++) {
+				for (int j = 1; j <= C; j++) {
+					System.out.print("O");
+				}
+				System.out.println();
+			}
+			return;
+		}
+		
+		if (N == 1) {
+			for (int i = 1; i <= R; i++) {
+				for (int j = 1; j <= C; j++) {
+					if (map[i][j] == 1)System.out.print("O");
+					else System.out.print(".");
+				}
+				System.out.println();
+			}
+			return;
+		}
+
+        int[][] newMap = new int[R+2][C+2];
+        for (int i = 1; i <= R; i++) {
+            for (int j = 1; j <= C; j++) {
+                newMap[i][j] = 1;
+            }
+        }
+        for (int i = 1; i <= R; i++) {
+            for (int j = 1; j <= C; j++) {
+                if (map[i][j] == 1) {
+                    newMap[i][j] = 0;
+
+                    newMap[i-1][j] = 0;
+                    newMap[i+1][j] = 0;
+                    newMap[i][j-1] = 0;
+                    newMap[i][j+1] = 0;
+                }
+            }
+        }
+        
+        if ((N+1)%4 == 0) {
+            for (int i = 1; i <= R; i++) {
+                for (int j = 1; j <= C; j++) {
+                    if (newMap[i][j] == 1)System.out.print("O");
+                    else System.out.print(".");
+                }
+                System.out.println();
+            }
+            return;
+        }
+
+        for (int i = 1; i <= R; i++) {
+            for (int j = 1; j <= C; j++) {
+                map[i][j] = newMap[i][j];
+                newMap[i][j] = 1;
+            }
+        }
+        for (int i = 1; i <= R; i++) {
+            for (int j = 1; j <= C; j++) {
+                if (map[i][j] == 1) {
+                    newMap[i][j] = 0;
+
+                    newMap[i-1][j] = 0;
+                    newMap[i+1][j] = 0;
+                    newMap[i][j-1] = 0;
+                    newMap[i][j+1] = 0;
+                }
+            }
+        }
+        for (int i = 1; i <= R; i++) {
+            for (int j = 1; j <= C; j++) {
+                if (newMap[i][j] == 1)System.out.print("O");
+                else System.out.print(".");
+            }
+            System.out.println();
+        }
+	}
+}
+```