백준 9019 DSLR(bfs)

https://www.acmicpc.net/problem/9019

9019번: DSLR

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<queue>
#include<vector>
#include<string.h>
using namespace std;


int sstart, eend;
vector<char> v;
int times;
int visited[10001];

void print(vector<char> calcul) {
	for (int i = 0; i < calcul.size(); i++) {
		printf("%c", calcul[i]);
	}
}
void bfs(int ss, int e) {
	
	queue <pair<int, vector<char> > > q;
	q.push(make_pair( ss, v ));
	//초기화 
	visited[ss] = 1;
	vector<char> d, s, l, r;
	while (!q.empty()) {
		int number = q.front().first;
		d=s=l=r = q.front().second;
		q.pop();

		
		int val = (number * 2) % 10000;
		if (visited[val] == 0) {
			d.push_back('D');
			if (val == eend) {
				print(d);
				return;
			}
			q.push(make_pair(val, d ));
			visited[val] = 1;
		}

		val = (number + 9999) % 10000;
		if (visited[val] == 0) {
			s.push_back('S');
			if (val == eend) {
				print(s);
				return;
			}
			q.push(make_pair(val, s ));
			visited[val] = 1;
		}
		val = (((number % 1000) * 10) + (number / 1000));
		if (visited[val] == 0) {
			l.push_back('L');
			if (val == eend) {
				print(l);
				return;
			}
			q.push(make_pair(val, l ));
			visited[val] = 1;
		}	
		val = (number % 10 * 1000) + (number / 10);
		if (visited[val] == 0) {
			r.push_back('R');
			if (val == eend) {
				print(r);
				return;
			}
			q.push(make_pair(val, r ));
			visited[val] = 1;
		}


	}



}
int main() {
	int testcase;
	scanf("%d", &testcase);
	for (int t = 0; t < testcase; t++) {
		memset(visited, 0, sizeof(visited));
		scanf("%d%d", &sstart, &eend);
		bfs(sstart, eend);
		printf("\n");

	}

	return 0;
}