QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#613503#6422. Evil Coordinatelhw#AC ✓43ms3720kbC++142.5kb2024-10-05 14:06:582024-10-05 14:10:01

Judging History

你现在查看的是最新测评结果

  • [2024-10-05 14:10:01]
  • 评测
  • 测评结果:AC
  • 用时:43ms
  • 内存:3720kb
  • [2024-10-05 14:06:58]
  • 提交

answer

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int N = 1e5 + 10;
#define int long long
int n, m;
int mx = 0;
int ans = 0;
int l, r, u, d;

void solve()
{
	int mx, my;
	cin >> mx >> my;
	l = r = u = d = 0;
	string s;
	cin >> s;
	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] == 'L')l++;
		else if (s[i] == 'R')r++;
		else if (s[i] == 'U')u++;
		else d++;
	}

	if (mx == 0 && my == 0)
	{
		cout << "Impossible" << endl;
		return;
	}
	if (mx == 0)
	{
		if (l == 0 && r == 0&&((my<0&&u-d<=my)||(my>0&&u-d>=my))) {
			cout << "Impossible" << endl;
			return;
		}
	}
	if (my == 0)
	{
		if (u == 0 && d == 0&&((mx<0&&r-l<=mx)||(mx>0&&r-l>=mx)))
		{
			cout << "Impossible" << endl;
			return;
		}
	}

	if (mx==r-l&&my==u-d) {
		cout << "Impossible" << endl;
		return;
	}
	
	if (mx==0)
	{
		if (l >= r)
		{
			while (l) {
				cout << "L";
				l--;
			}
		}
		else {
			while (r)
			{
				cout << "R";
				r--;
			}
		}
		if (my < 0)
		{
			while (u)
			{
				cout << "U";
				u--;
			}
			while (d)
			{
				cout << "D";
				d--;
			}
		}
		else {
			while (d)
			{
				cout << "D";
				d--;
			}
			while (u)
			{
				cout << "U";
				u--;
			}
			
		}
		if (r !=0)
		{
			while (r)
			{
				cout << "R";
				r--;
			}
		}
		if(l!=0) {
			while (l) {
				cout << "L";
				l--;
			}
		}
		cout << endl;
		return;
	}

	if (my == 0)
	{
		if (u >= d)
		{
			while (u)
			{
				cout << "U";
				u--;
			}
		}
		else {
			while (d)
			{
				cout << "D";
				d--;
			}
		}
		if (mx < 0)
		{while (r)
			{
				cout << "R";
				r--;
			}
			while (l) {
				cout << "L";
				l--;
			}
			
		}
		else {
			while (l) {
				cout << "L";
				l--;
			}
			while (r)
			{
				cout << "R";
				r--;
			}
		}
		if (d !=0)
		{
			while (d)
			{
				cout << "D";
				d--;
			}
		}
		if(u!=0) {
			while (u)
			{
				cout << "U";
				u--;
			}
		}
		cout << endl;
		return;
	}
	if (mx != r - l)
	{
		while (l)
		{
			cout << "L";
			l--;
		}
		while (r)
		{
			cout << 'R';
			r--;
		}
		while (d)
		{
			cout << "D";
			d--;
		}
		while (u)
		{
			cout << "U";
			u--;
		}
	}
	else {
		while (d)
		{
			cout << "D";
			d--;
		}
		while (u) {
			cout << "U";
			u--;
		}
		while (l)
		{
			cout << "L";
			l--;
		}
		while (r)
		{
			cout << "R";
			r--;
		}
	}
	cout << endl;
}

signed main()
{
	int T;
	cin >> T;
	while (T--)
	{
		solve();
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3592kb

input:

5
1 1
RURULLD
0 5
UUU
0 3
UUU
0 2
UUU
0 0
UUU

output:

LLRRDUU
UUU
Impossible
Impossible
Impossible

result:

ok 5 cases

Test #2:

score: 0
Accepted
time: 32ms
memory: 3640kb

input:

11109
6 0
RUDUDR
2 0
URU
0 0
UDRU
0 0
R
-1 1
LDUUDDRUUL
-1 5
RRUUUDUUU
-8 4
RRDRLDR
2 0
UD
0 0
UUDD
3 -2
LDDLLLRR
3 -2
LDRURLDD
1 0
RRL
-1 0
DUDDLLRDU
-4 0
LL
-1 -1
DLRLDLUDUR
1 4
URDULUR
0 0
DDUUDUDDDD
0 2
UU
1 0
RRULD
0 -2
LDLRLLDRRL
0 1
RLRLLRLUR
-3 0
RL
0 0
D
0 0
L
0 0
DDLRRUDRUD
0 0
DULU
2 0
RR...

output:

UURRDD
UUR
Impossible
Impossible
Impossible
RRDUUUUUU
LRRRRDD
UD
Impossible
LLLLRRDD
LLRRDDDU
Impossible
DDDDRLLUU
LL
Impossible
DUUULRR
Impossible
Impossible
Impossible
LLLLLDDRRR
Impossible
RL
Impossible
Impossible
Impossible
Impossible
Impossible
RRRRRUULLL
LLLDU
Impossible
UUULDDD
DDUURR
Impossi...

result:

ok 11109 cases

Test #3:

score: 0
Accepted
time: 43ms
memory: 3720kb

input:

11107
1 0
LLRLRURLR
1 0
LLRR
0 1
R
1 0
LLLRLRRR
1 0
RUL
0 1
UD
1 0
RLRLU
0 1
DDDUUUDU
1 0
RURRLLRLL
1 0
LRLR
1 0
ULR
0 1
R
0 1
DDUUUDR
0 1
UUDDUDDU
0 1
DDUUDU
1 0
RRLRLLRLRL
1 0
RLRRLL
1 0
LUR
1 0
U
1 0
LRRRLLLR
0 1
DRUUDDUDU
0 1
DUUDDUR
1 0
LRLRLR
0 1
UUDDDUDU
0 1
R
0 1
UDUDDU
0 1
DUUDUD
1 0
RRLRRR...

output:

ULLLLRRRR
LLRR
R
LLLLRRRR
ULR
DU
ULLRR
DDDDUUUU
ULLLLRRRR
LLRR
ULR
R
RDDDUUU
DDDDUUUU
DDDUUU
LLLLLRRRRR
LLLRRR
ULR
U
LLLLRRRR
RDDDDUUUU
RDDDUUU
LLLRRR
DDDDUUUU
R
DDDUUU
DDDUUU
LLLLLRRRRR
DDDDUUUU
DDUU
ULLLLRRRR
DDUU
LLLRRR
ULR
ULR
U
ULR
LLLRRR
LLLLLRRRRR
U
DDDUUU
R
LLLRRR
RDDDDUUUU
RDDDDUUUU
LLLRRR
...

result:

ok 11107 cases