BOJ/9019)DSLR.cpp at main · KimRabbert/BOJ · GitHub

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
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	vector<string> result(10000, "");
	queue<int> q;
	int tc;
	int a, b;
	int cur, tmp;

	cin >> tc;

	for (int i = 0; i < tc; i++) {
		cin >> a >> b;

		result[a] = ".";

		q.push(a);

		while (!q.empty()) {
			cur = q.front();
			q.pop();

			tmp = (cur * 2) % 10000;
			if (result[tmp] == "") {
				result[tmp] = result[cur] + "D";

				if (tmp == b)
					break;

				q.push(tmp);
			}

			tmp = (cur + 9999) % 10000;
			if (result[tmp] == "") {
				result[tmp] = result[cur] + "S";

				if (tmp == b)
					break;

				q.push(tmp);
			}

			tmp = (cur % 1000) * 10 + cur / 1000;
			if (result[tmp] == "") {
				result[tmp] = result[cur] + "L";

				if (tmp == b)
					break;

				q.push(tmp);
			}

			tmp = cur / 10 + (cur % 10) * 1000;
			if (result[tmp] == "") {
				result[tmp] = result[cur] + "R";

				if (tmp == b)
					break;

				q.push(tmp);
			}
		}

		result[b].erase(result[b].begin());
		cout << result[b] << '\n';

		while (!q.empty()) q.pop();
		result.assign(10000, "");
	}
}