QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#612494#6422. Evil CoordinatedyfhpuWA 34ms3864kbC++171.6kb2024-10-05 11:33:412024-10-05 11:33:43

Judging History

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

  • [2024-10-05 11:33:43]
  • 评测
  • 测评结果:WA
  • 用时:34ms
  • 内存:3864kb
  • [2024-10-05 11:33:41]
  • 提交

answer

#include <iostream>
#include <cstring>
#include <map>
using namespace std;
void solve()
{
	int x,y;cin>>x>>y;
	string s;cin>>s;
	map<char,int> mp;
	int edx=0,edy=0;
	for(int i=0;i<s.size();i++) {
		mp[s[i]]++;
		if(s[i]=='R') {
			edx++;
		}
		else if(s[i]=='L') {
			edx--;
		}
		else if(s[i]=='U') {
			edy++;
		}
		else {
			edy--;
		}
	}
	if(edx==x&&edy==y||x==0&&y==0) {
		cout<<"Impossible"<<endl;
		return ;
	} 
	int sum1=mp['R'],sum2=mp['L'],sum3=mp['U'],sum4=mp['D'];
	if((sum3-sum4)>=y&&sum1==0&&sum2==0) {
		cout<<"Impossible"<<endl;
		return ;
	}
	if((sum1-sum2)>=x&&sum3==0&&sum2==0&&sum4==0) {
		cout<<"Impossible"<<endl;
		return ;
	}
	if((sum4-sum3)>=abs(y)&&y<=0&&sum1==0&&sum2==0&&sum3==0) {
		cout<<"Impossible"<<endl;
		return ;
	}
	if((sum2-sum1)>=abs(x)&&x<=0&&sum1==0&&sum3==0&&sum4==0) {
		cout<<"Impossible"<<endl;
		return ;
	}
	if(x>=0&&y>=0) {
		while(sum2--) cout<<'L';
		while(sum4--) cout<<'D';
		while(sum1--) cout<<'R';
		while(sum3--) cout<<'U';
		cout<<endl;
	}
	else if(x>=0&&y<0) {
		while(sum2--) cout<<'L';
		while(sum3--) cout<<'U';
		while(sum1--) cout<<'R';
		while(sum4--) cout<<'D';
		cout<<endl;
	}
	else if(x<0&&y>=0) {
		while(sum1--) cout<<'R';
		while(sum4--) cout<<'D';
		while(sum3--) cout<<'U';
		while(sum2--) cout<<'L';
		cout<<endl;
	}
	else if(x<0&&y<0) {	
		while(sum1--) cout<<'R';
		while(sum3--) cout<<'U';
		while(sum2--) cout<<'L';
		while(sum4--) cout<<'D';
		cout<<endl;
	}
}
int main()
{
	int t;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

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

output:

LLDRRUU
UUU
Impossible
Impossible
Impossible

result:

ok 5 cases

Test #2:

score: -100
Wrong Answer
time: 34ms
memory: 3864kb

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:

DDRRUU
RUU
Impossible
Impossible
Impossible
RRDUUUUUU
RRRRDDL
Impossible
Impossible
LLLLRRDD
LLURRDDD
Impossible
RDDDDUULL
LL
Impossible
LDRRUUU
Impossible
Impossible
Impossible
LLLLLRRRDD
Impossible
RL
Impossible
Impossible
Impossible
Impossible
Impossible
LLLRRRRRUU
ULLLD
Impossible
DDDUUUL
UURRDD...

result:

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