From cf082a24e27b37e190e5a036ac4730326d8698af Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Thu, 6 Feb 2025 15:39:25 +0900
Subject: [PATCH] =?UTF-8?q?[20250206]=20BOJ=20/=20=EA=B3=A8=EB=93=9C3=20/?=
 =?UTF-8?q?=20=EC=95=84=EA=B8=B0=EB=8F=BC=EC=A7=80=EC=99=80=20=EB=8A=91?=
 =?UTF-8?q?=EB=8C=80=20/=20=EA=B6=8C=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\354\231\200 \353\212\221\353\214\200.md" | 92 +++++++++++++++++++
 1 file changed, 92 insertions(+)
 create mode 100644 "khj20006/202502/06 BOJ G3 \354\225\204\352\270\260\353\217\274\354\247\200\354\231\200 \353\212\221\353\214\200.md"

diff --git "a/khj20006/202502/06 BOJ G3 \354\225\204\352\270\260\353\217\274\354\247\200\354\231\200 \353\212\221\353\214\200.md" "b/khj20006/202502/06 BOJ G3 \354\225\204\352\270\260\353\217\274\354\247\200\354\231\200 \353\212\221\353\214\200.md"
new file mode 100644
index 00000000..f9255992
--- /dev/null
+++ "b/khj20006/202502/06 BOJ G3 \354\225\204\352\270\260\353\217\274\354\247\200\354\231\200 \353\212\221\353\214\200.md"	
@@ -0,0 +1,92 @@
+```java
+
+import java.util.*;
+import java.io.*;
+
+class Main {
+	
+	// IO field
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static int nextInt() {return Integer.parseInt(st.nextToken());}
+	static long nextLong() {return Long.parseLong(st.nextToken());}
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+	static char[][] arr;
+	static boolean[][] vis;
+	static int[] dx = {1,0,-1,0};
+	static int[] dy = {0,1,0,-1};
+	
+	static int N, M;
+	
+	
+	
+	public static void main(String[] args) throws Exception {
+		
+		ready();
+		solve();
+		
+		bwEnd();
+	}
+	
+	static void ready() throws Exception{
+
+		nextLine();
+		N = nextInt();
+		M = nextInt();
+		arr = new char[N][M];
+		vis = new boolean[N][M];
+		for(int i=0;i<N;i++) arr[i] = br.readLine().toCharArray();
+		
+	}
+	
+	static void solve() throws Exception{
+
+		Queue<int[]> Q = new LinkedList<>();
+		for(int i=0;i<N;i++) for(int j=0;j<M;j++) if(arr[i][j] == 'W') {
+			Q.add(new int[] {i,j});
+			vis[i][j] = true;
+		}
+		
+		while(!Q.isEmpty()) {
+			int[] temp = Q.poll();
+			int x = temp[0], y = temp[1];
+			
+			for(int i=0;i<4;i++) {
+				int xx = x+dx[i], yy = y+dy[i];
+				while(arr[xx][yy] == '+') {
+					xx += dx[i];
+					yy += dy[i];
+				}
+				
+				if(arr[xx][yy] == '#') {
+					xx -= dx[i];
+					yy -= dy[i];
+				}
+				
+				if(vis[xx][yy]) continue;
+				Q.offer(new int[] {xx,yy});
+				vis[xx][yy] = true;
+				
+			}
+			
+		}
+		
+		for(int i=0;i<N;i++) {
+			for(int j=0;j<M;j++) {
+				if(arr[i][j] == '.' && !vis[i][j]) bw.write('P');
+				else bw.write(arr[i][j]);
+			}
+			bw.write("\n");
+		}
+		
+		
+	}
+	
+}
+
+```