OKOJIN
solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
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<int[]> 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;
				}
			}
		}
	}
}