-
Notifications
You must be signed in to change notification settings - Fork 0
/
DSLR.java
266 lines (237 loc) · 8.05 KB
/
DSLR.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
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.StringTokenizer;
import java.util.Queue;
// D 값을 2배로 설정, 9999보다 클 경우에는 10000으로 나눈 나머지를 반환
// S 1을 뺀 결과 출력, 음수일 경우에는 9999반환
// L 가장 왼쪽의 값을 오른쪽에 넣어줌
// R 가장 오른쪽의 값을 왼쪽에 넣어줌
public class DSLR {
public static StringBuilder sb = new StringBuilder();
public static Queue<Integer> resultQueue;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
int test = Integer.parseInt(br.readLine());
for(int i = 0; i < test; i++) {
st = new StringTokenizer(br.readLine(), " ");
int start = Integer.parseInt(st.nextToken());
int end = Integer.parseInt(st.nextToken());
boolean[] visit = new boolean[10000];
String[] command = new String[10000];
initResultQueue();
getMinCommand(visit, command, start, end);
}
System.out.print(sb.toString());
}
public static void getMinCommand(boolean[] visit, String[] command, int start, int end) {
command[start] = "";
resultQueue.offer(start);
while(!resultQueue.isEmpty()) {
int value = resultQueue.poll();
if(value == end) {
sb.append(command[value] + "\n");
break;
}
if(visit[value]) continue;
visit[value] = true;
int D = calculateD(value);
int S = calculateS(value);
int L = calculateL(value);
int R = calculateR(value);
if(!visit[D]) {
if(command[D] == null) command[D] = command[value] + "D";
else {
int originLength = command[D].length();
int newLength = command[value].length();
if(originLength > newLength) command[D] = command[value] + "D";
}
resultQueue.offer(D);
}
if(!visit[S]) {
if(command[S] == null) command[S] = command[value] + "S";
else {
int originLength = command[S].length();
int newLength = command[value].length();
if(originLength > newLength) command[S] = command[value] + "S";
}
resultQueue.offer(S);
}
if(!visit[L]) {
if(command[L] == null) command[L] = command[value] + "L";
else {
int originLength = command[L].length();
int newLength = command[value].length();
if(originLength > newLength) command[L] = command[value] + "L";
}
resultQueue.offer(L);
}
if(!visit[R]) {
if(command[R] == null) command[R] = command[value] + "R";
else {
int originLength = command[R].length();
int newLength = command[value].length();
if(originLength > newLength) command[R] = command[value] + "R";
}
resultQueue.offer(R);
}
}
}
public static int calculateD(int value) {
return (2 * value) % 10000;
}
public static int calculateS(int value) {
return (value == 0)? 9999 : value - 1;
}
public static int calculateL(int value) {
return (value % 1000) * 10 + (value / 1000);
}
public static int calculateR(int value) {
return (value % 10) * 1000 + (value / 10);
}
public static void initResultQueue() {
resultQueue = new LinkedList<>();
}
}
//public class DSLR {
//
// public static class Command {
// private String command;
// private boolean visit;
//
// public Command(String command) {
// this.command = command;
// this.visit = false;
// }
//
// public String getCommand() {
// return this.command;
// }
//
// public boolean isVisit() {
// return this.visit;
// }
//
// public void setCommand(String command) {
// if(this.command.equals("")) {
// this.command = command;
// return;
// }
//
// this.command = (this.command.length() < command.length())? this.command : command;
// }
//
// public void visit() {
// this.visit = true;
// }
// }
//
// public static Command[] resultArr;
// public static Queue<Integer> resultQueue;
// public static StringBuilder sb = new StringBuilder();
//
// public static void main(String[] args) throws IOException {
// BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
// StringTokenizer st;
//
// int test = Integer.parseInt(br.readLine());
//
// for(int i = 0; i < test; i++) {
// st = new StringTokenizer(br.readLine(), " ");
// initResultQueue();
// initResultArr();
//
// int now = Integer.parseInt(st.nextToken());
// int target = Integer.parseInt(st.nextToken());
//
// getMinCommand(now, target);
// }
//
// System.out.println(sb.toString());
// }
//
// public static void getMinCommand(int now, int target) {
// resultQueue.offer(now);
//
// while(!resultQueue.isEmpty()) {
// int value = resultQueue.poll();
//
// if(value == target) break;
// if(resultArr[value].isVisit()) continue;
//
// resultArr[value].visit();
// String command = resultArr[value].getCommand();
//
// int D = calculateD(value);
// int S = calculateS(value);
// int L = calculateL(value);
// int R = calculateR(value);
//
// if(!resultArr[D].isVisit()) {
// resultQueue.offer(D);
// resultArr[D].setCommand(command + "D");
// }
//
// if(!resultArr[S].isVisit()) {
// resultQueue.offer(S);
// resultArr[S].setCommand(command + "S");
// }
//
// if(!resultArr[L].isVisit()) {
// resultQueue.offer(L);
// resultArr[L].setCommand(command + "L");
// }
//
// if(!resultArr[R].isVisit()) {
// resultQueue.offer(R);
// resultArr[R].setCommand(command + "R");
// }
// }
//
// sb.append(resultArr[target].getCommand() + "\n");
// }
// // D 값을 2배로 설정, 9999보다 클 경우에는 10000으로 나눈 나머지를 반환
// public static int calculateD(int value) {
// return (2 * value) % 10000;
// }
//
// // S 1을 뺀 결과 출력, 음수일 경우에는 9999반환
// public static int calculateS(int value) {
// return (value == 0)? 9999 : value - 1;
// }
//
// // L 가장 왼쪽의 값을 오른쪽에 넣어줌
// public static int calculateL(int value) {
// int first = value / 1000;
// int second = value % 1000 / 100;
// int third = value % 100 / 10;
// int forth = value % 10;
//
// return 1000 * second + 100 * third + 10 * forth + first;
// }
//
// // R 가장 오른쪽의 값을 왼쪽에 넣어줌
// public static int calculateR(int value) {
// int first = value / 1000;
// int second = value % 1000 / 100;
// int third = value % 100 / 10;
// int forth = value % 10;
//
// return 1000 * forth + 100 * first + 10 * second + third;
// }
//
// public static void initResultQueue() {
// resultQueue = new LinkedList<>();
// }
//
// public static void initResultArr() {
// resultArr = new Command[10000];
//
// for(int i = 0; i < 10000; i++) {
// resultArr[i] = new Command("");
// }
// }
//}