QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#506392#6422. Evil CoordinateGrunrayWA 11ms4124kbC++203.6kb2024-08-05 17:08:392024-08-05 17:08:40

Judging History

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

  • [2024-08-05 17:08:40]
  • 评测
  • 测评结果:WA
  • 用时:11ms
  • 内存:4124kb
  • [2024-08-05 17:08:39]
  • 提交

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 edx = 0, edy = 0;
	int x, y;
	cin >> x >> y;
	string s;
	cin >> s;
	memset(a, 0, sizeof(a));
	if (x == 0 && y == 0) {
		cout << "Impossible" << endl;
		return;
	}

	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]++;
	}
	edx = a[3] - a[2];
	edy = a[0] - a[1];

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

	if (edy == y)
	{
		if (!y)
		{
			if (a[0]) {
				cout << 'U';
				--a[0];
			}
			else if (a[1]) {
				cout << 'D';
				--a[1];
			}
			//cout << "U";
			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]; 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]; i++) cout << "U";
			for (int i = 0; i < a[1]; i++) cout << "D";
		}
	}
	else if (edx == x)
	{
		if (!x) {
			if (a[2]) {
				cout << 'L';
				--a[2];
			}
			else if (a[3]) {
				cout << 'R';
				--a[3];
			}
		}
		for (int i = 0; i < a[0]; i++) cout << "U";
		for (int i = 0; i < a[1]; i++) cout << "D";
		for (int i = 0; i < a[2]; i++) cout << "L";
		for (int i = 0; i < a[3]; i++) cout << "R";
	}
	else
	{
		if (!x) {
			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]; i++) cout << "U";
			for (int i = 0; i < a[1]; i++) cout << "D";
		}
		else {
			for (int i = 0; i < a[0]; i++) cout << "U";
			for (int i = 0; i < a[1]; i++) cout << "D";
			for (int i = 0; i < a[2]; i++) cout << "L";
			for (int i = 0; i < a[3]; i++) cout << "R";
		}
		
	}
	cout << '\n';

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

}

詳細信息

Test #1:

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

input:

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

output:

LLRRUUD
UUU
Impossible
Impossible
Impossible

result:

ok 5 cases

Test #2:

score: -100
Wrong Answer
time: 11ms
memory: 4124kb

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
UUR
Impossible
Impossible
Impossible
RRUUUUUUD
DDLRRRR
UD
Impossible
LLLLRRDD
LLRRUDDD
Impossible
UUDDDDLLR
LL
Impossible
UUUDLRR
Impossible
Impossible
Impossible
LLLLLRRRDD
Impossible
RL
Impossible
Impossible
Impossible
Impossible
Impossible
LLLRRRRRUU
UDLLL
Impossible
ULUUDDD
UUDDRR
Impossi...

result:

wrong answer case 113, participant does not find an answer but the jury does