1873. 상호의 배틀필드
2020. 2. 10. 14:47ㆍLearn/Algorithm
|
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int Test = sc.nextInt();
for(int t = 1; t<= Test; t++) {
int H = sc.nextInt();
int W = sc.nextInt();
char arr[][] = new char [H+1][W+1];
int n =0;
int w = 0;
String s;
for(int i = 0; i <= H; i++) {
s = sc.nextLine();
for(int k = 0; k< s.length(); k++) {
arr[i][k] = s.charAt(k);
if(s.charAt(k) == '^' || s.charAt(k) == 'v' || s.charAt(k) == '<' || s.charAt(k) == '>' ) {
n = i;
w = k;
}
}
}
int num = sc.nextInt();
sc.nextLine();
String st = sc.nextLine();
for(int i = 0; i < st.length(); i++) {
if(st.charAt(i) == 'U') {
arr[n][w] = '^';
if(n-1 >= 0 && arr[n-1][w] == '.') {
arr[n][w] = '.';
arr[n-1][w] = '^';
n -= 1;
}
}
if(st.charAt(i) == 'D') {
arr[n][w] = 'v';
if(n+1 < H+1 && arr[n+1][w] == '.') {
arr[n][w] = '.';
arr[n+1][w] = 'v';
n += 1;
}
}
if(st.charAt(i) == 'L') {
arr[n][w] = '<';
if(w-1 >= 0 && arr[n][w-1] == '.') {
arr[n][w] = '.';
arr[n][w-1] = '<';
w -= 1;
}
}
if(st.charAt(i) == 'R') {
arr[n][w] = '>';
if(w+1 < W+1 && arr[n][w+1] == '.') {
arr[n][w] = '.';
arr[n][w+1] = '>';
w += 1;
}
}
if(st.charAt(i) == 'S') {
if(arr[n][w] == '^') {
for(int shot = n-1; shot >= 0; shot--) {
if(arr[shot][w] == '.'|| arr[shot][w] == '-')
continue;
if(arr[shot][w] == '*') {
arr[shot][w] = '.';
break;
}
else
break;
}
}
if(arr[n][w] == 'v') {
for(int shot = n+1; shot < H+1; shot++) {
if(arr[shot][w] == '.'|| arr[shot][w] == '-')
continue;
if(arr[shot][w] == '*') {
arr[shot][w] = '.';
break;
}
else
break;
}
}
if(arr[n][w] == '>') {
for(int shot = w+1; shot < W+1; shot++) {
if(arr[n][shot] == '.' || arr[n][shot] == '-')
continue;
if(arr[n][shot] == '*') {
arr[n][shot] = '.';
break;
}
else
break;
}
}
if(arr[n][w] == '<') {
for(int shot = w-1; shot >= 0; shot--) {
if(arr[n][shot] == '.'|| arr[n][shot] == '-')
continue;
if(arr[n][shot] == '*') {
arr[n][shot] = '.';
break;
}
else
break;
}
}
}
}
System.out.print("#" + t + " ");
for(int i = 1; i <= H; i++) {
for(int j = 0; j < W; j++)
System.out.print(arr[i][j]);
System.out.println();
}
}
}
}
http://colorscripter.com/info#e" target="_blank" style="color:#4f4f4ftext-decoration:none">Colored by Color Scripter
http://colorscripter.com/info#e" target="_blank" style="text-decoration:none;color:white">cs |
|
시뮬레이션
'Learn > Algorithm' 카테고리의 다른 글
| 1861 정사각형 방 (0) | 2020.02.10 |
|---|---|
| 1828 냉장고 (0) | 2020.02.10 |
| 4408 자기방으로 돌아가기 (0) | 2020.02.10 |
| 14501번 퇴사코드 - DP (0) | 2020.02.07 |
| 1244 스위치 켜고 끄기 - 재귀연습 (0) | 2020.02.07 |