QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#613038#6422. Evil Coordinatelaing2122WA 31ms3668kbC++173.1kb2024-10-05 13:28:082024-10-05 13:28:12

Judging History

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

  • [2024-10-05 13:28:12]
  • 评测
  • 测评结果:WA
  • 用时:31ms
  • 内存:3668kb
  • [2024-10-05 13:28:08]
  • 提交

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

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

詳細信息

Test #1:

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

input:

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

output:

DLLRRUU
UUU
Impossible
Impossible
Impossible

result:

ok 5 cases

Test #2:

score: -100
Wrong Answer
time: 31ms
memory: 3668kb

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
DRRUUUUUU
DDRRRRL
UD
Impossible
LLLLRRDD
ULLRRDDD
Impossible
DDDDRLLUU
LL
Impossible
DLRRUUU
Impossible
Impossible
ULRRD
LLLLLDDRRR
LLLLURRRR
RL
Impossible
Impossible
Impossible
Impossible
Impossible
RRRRRUULLL
ULLLD
Impossible
UUULDDD
UURRDD
Impossible
UU...

result:

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