QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#682754 | #6422. Evil Coordinate | QF_love_younger_sister | WA | 15ms | 3696kb | C++14 | 3.0kb | 2024-10-27 17:14:09 | 2024-10-27 17:14:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
string ss;
void solve(){
int xd,yd;
cin >> xd >> yd;
cin >> ss;
//cout << ss << "\n";
int len=ss.size();
int u=0,d=0,l=0,r=0;
for(int i=0; i<len; i++){
if(ss[i]=='R') r++;
if(ss[i]=='U') u++;
if(ss[i]=='L') l++;
if(ss[i]=='D') d++;
}
if(r-l==xd && u-d==yd){
cout << "Impossible\n";
return;
}
if(xd==0 && yd==0){
cout << "Impossible\n";
return;
}
if(xd!=0 && yd!=0){
int mbx=r-l;
if(mbx==xd){
while(u!=0){
u--;
cout << "U";
}
while(d!=0){
d--;
cout << "D";
}
while(l!=0){
l--;
cout << "L";
}
while(r!=0){
r--;
cout << "R";
}
}
else{
while(l!=0){
l--;
cout << "L";
}
while(r!=0){
r--;
cout << "R";
}
while(u!=0){
u--;
cout << "U";
}
while(d!=0){
d--;
cout << "D";
}
}
}
if(xd!=0 && yd==0){
if(u==0 && d==0){
if(xd>0){
if(r-l>=xd){
cout << "Impossible\n";
return;
}
else{
while(l!=0){
l--;
cout << "L";
}
while(r!=0){
r--;
cout << "R";
}
}
}
else{
if(l-r>=-1*xd){
cout << "Impossible\n";
return;
}
else{
while(r!=0){
r--;
cout << "R";
}
while(l!=0){
l--;
cout << "L";
}
}
}
}
else{
if(u!=0){
while(u!=0){
u--;
cout << "U";
}
while(r!=0){
r--;
cout << "R";
}
while(l!=0){
l--;
cout << "L";
}
while(d!=0){
d--;
cout << "D";
}
}
else{
while(d!=0){
d--;
cout << "D";
}
while(r!=0){
r--;
cout << "R";
}
while(l!=0){
l--;
cout << "L";
}
while(u!=0){
u--;
cout << "U";
}
}
}
}
if(xd==0 && yd!=0){
if(l==0 && r==0){
if(yd>0){
if(u-d>=yd){
cout << "Impossible\n";
return;
}
else{
while(d!=0){
d--;
cout << "D";
}
while(u!=0){
u--;
cout << "U";
}
}
}
else{
if(d-u>=-1*yd){
cout << "Impossible\n";
return;
}
else{
while(u!=0){
u--;
cout << "U";
}
while(d!=0){
d--;
cout << "D";
}
}
}
}
else{
if(r!=0){
while(r!=0){
r--;
cout << "R";
}
while(u!=0){
u--;
cout << "U";
}
while(d!=0){
d--;
cout << "D";
}
while(l!=0){
l--;
cout << "L";
}
}
else{
while(l!=0){
l--;
cout << "L";
}
while(u!=0){
u--;
cout << "U";
}
while(d!=0){
d--;
cout << "D";
}
while(r!=0){
r--;
cout << "R";
}
}
}
}
cout << "\n";
return;
}
signed main(){
ios::sync_with_stdio(false),cin.tie(0);
int _=1;
cin>>_;
while(_--) solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3684kb
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: 15ms
memory: 3696kb
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 RRUUUUUUD LRRRRDD UD Impossible LLLLRRDD LLRRUDDD Impossible UURLLDDDD LL Impossible UUUDLRR Impossible Impossible Impossible RRRDDLLLLL Impossible RL Impossible Impossible Impossible Impossible Impossible RRRRRUULLL LLLUD Impossible UUULDDD UUDDRR Impossi...
result:
wrong answer case 13, participant's output goes through forbidden coordinate