QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#506285#6422. Evil Coordinate18953267621WA 19ms4056kbC++142.4kb2024-08-05 16:26:122024-08-05 16:26:12

Judging History

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

  • [2024-08-05 16:26:12]
  • 评测
  • 测评结果:WA
  • 用时:19ms
  • 内存:4056kb
  • [2024-08-05 16:26:12]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e3 + 5;
int a[N];
int b[N];int n, m;
int c[N];
int coun[N];
double l[N], r[N];
void solve()
{
	
	int x, y;
	cin >> x >> y;
	
	string s;
	cin >> s;
	if (x == 0 && y == 0)
	{
		cout << "Impossible" << endl;
		return;
	}
	memset(a, 0, sizeof(a));
	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] == 'U') a[0]++;
		if (s[i] == 'D') a[1]++;
		if (s[i] == 'L') a[2]++;
		if (s[i] == 'R') a[3]++;

	}
	if (((a[0] - a[1]) == y) && ((a[3] - a[2]) == x))
	{
		cout << "Impossible" << endl;
		return;
	}
	else if ((a[2] == 0 && a[3] == 0))
	{
		if (y >0 && a[0] - a[1] >= y)
		{
			cout << "Impossible" << endl;
			return;
			
		}
		if (y < 0 && a[0] - a[1] <= y)
		{
			cout << "Impossible" << endl;
			return;
			
		}
	}
	else if ((a[0] == 0 && a[1] == 0))
	{
		if (x >0 && a[3] - a[2] >= x)
		{
			cout << "Impossible" << endl;
			return;
			
		}
		if (x < 0 && a[3] - a[2] <= x)
		{
			cout << "Impossible" << endl;
			return;
			
		}
	}
	
	if (a[0]-a[1]==y )
	{
		if (y == 0)
		{
			if(a[0]!=0)
			cout << "U";
			if (x < 0)
			{for (int i = 0; i < a[3]; i++) cout << "R";
		for (int i = 0; i < a[2]; i++) cout << "L";
		for (int i = 0; i < a[0]-1; i++) cout << "U";
		for (int i = 0; i < a[1]; i++) cout << "D";

			}
			else
			{for (int i = 0; i < a[2]; i++) cout << "L";
				for (int i = 0; i < a[3]; i++) cout << "R";
				
				for (int i = 0; i < a[0] - 1; i++) cout << "U";
				for (int i = 0; i < a[1]; i++) cout << "D";

			}
		
					

		}
		else
	{
		for (int i = 0; i < a[3]; i++) cout << "R";
		for (int i = 0; i < a[2]; i++) cout << "L";
		for (int i = 0; i < a[1]; i++) cout << "D";
		for (int i = 0; i < a[0]; i++) cout << "U";
	}
	

	}

	else if (a[3] - a[2] == x)
	{
			for (int i = 0; i < a[1]; i++) cout << "D";
			for (int i = 0; i < a[0]; i++) cout << "U";
			for (int i = 0; i < a[3]; i++) cout << "R";
			for (int i = 0; i < a[2]; i++) cout << "L";
			
		


	}
	else
	{
		for (int i = 0; i < a[3]; i++) cout << "R";
		for (int i = 0; i < a[2]; i++) cout << "L";
		for (int i = 0; i < a[1]; i++) cout << "D";
		for (int i = 0; i < a[0]; i++) cout << "U";
	}
	cout << endl;

}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3848kb

input:

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

output:

RRLLDUU
UUU
Impossible
Impossible
Impossible

result:

ok 5 cases

Test #2:

score: -100
Wrong Answer
time: 19ms
memory: 4056kb

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:

URRUDD
RUU
Impossible
Impossible
Impossible
RRDUUUUUU
RRRRLDD
UD
Impossible
RRLLLLDD
RRLLDDDU
Impossible
DDDDUURLL
LL
Impossible
DUUURRL
Impossible
Impossible
Impossible
RRRLLLLLDD
Impossible
RL
Impossible
Impossible
Impossible
Impossible
Impossible
RRRRRLLLUU
LLLDU
Impossible
ULUUDDD
DDUURR
Impossi...

result:

wrong answer case 42, participant's output goes through forbidden coordinate