-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdslr.cpp
More file actions
68 lines (54 loc) · 1.29 KB
/
dslr.cpp
File metadata and controls
68 lines (54 loc) · 1.29 KB
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
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#define MAXNUM 10000
using namespace std;
vector<char> seq {'D', 'S', 'L', 'R'};
string bfs(int a, int b)
{
bool find = false;
vector<string> commands(MAXNUM, "");
queue<int> q;
q.push(a);
while (!q.empty())
{
int cur = q.front();
q.pop();
vector<int> dslr;
dslr.push_back(cur * 2 % MAXNUM);
dslr.push_back((cur + MAXNUM - 1) % MAXNUM);
dslr.push_back((cur % 1000) * 10 + (cur / 1000));
dslr.push_back(cur / 10 + (cur % 10) * 1000);
for (int i=0; i<4; ++i)
{
int next = dslr[i];
if (!commands[next].empty() || next == a) // 더 깔끔하게 처리할 수 있을거같은데..
continue;
commands[next] = commands[cur] + seq[i];
if (next == b)
{
find = true;
break;
}
q.push(next);
}
if (find)
break;
}
return commands[b];
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
int testcase;
cin >> testcase;
while (testcase--)
{
int a, b;
cin >> a >> b;
cout << bfs(a, b) << "\n";
}
return 0;
}