import java.io.*; import java.util.*; public class Main { static int R, C; static int hr, hc; static char[][] map; static boolean[][] canLook; static int[] dr = {1, -1, 0, 0}; static int[] dc = {0, 0, 1, -1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); StringTokenizer st = new StringTokenizer(br.readLine()); R = Integer.parseInt(st.nextToken()); C = Integer.parseInt(st.nextToken()); map = new char[R][C]; canLook = new boolean[R][C]; for (int i = 0; i < R; i++) { map[i] = br.readLine().toCharArray(); } st = new StringTokenizer(br.readLine()); hr = Integer.parseInt(st.nextToken()) - 1; hc = Integer.parseInt(st.nextToken()) - 1; char[] commands = br.readLine().toCharArray(); for (char command : commands) { switch (command) { case 'W': { ward(hr, hc); break; } case 'U': { hr--; break; } case 'R': { hc++; break; } case 'D': { hr++; break; } case 'L': { hc--; break; } } } canLook[hr][hc] = true; for (int i = 0; i < 4; i++) { int nr = hr + dr[i]; int nc = hc + dc[i]; if (nr >= 0 && nr < R && nc >= 0 && nc < C) { canLook[nr][nc] = true; } } for (int i = 0; i < R; i++) { for (int j = 0; j < C; j++) { sb.append(canLook[i][j] ? '.' : '#'); } sb.append('\n'); } System.out.println(sb.toString()); } static void ward(int r, int c) { char initial = map[r][c]; Deque q = new ArrayDeque<>(); q.offer(new int[] {r, c}); canLook[r][c] = true; while (!q.isEmpty()) { int[] cur = q.poll(); int cr = cur[0]; int cc = cur[1]; for (int i = 0; i < 4; i++) { int nr = cr + dr[i]; int nc = cc + dc[i]; if (nr >= 0 && nr < R && nc >= 0 && nc < C && !canLook[nr][nc] && map[nr][nc] == initial) { q.offer(new int[] {nr, nc}); canLook[nr][nc] = true; } } } } }

ALGORITHM ARCHIVE

퇴사2

웹 브라우저2

와드

PPAP