QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#247729 | #6422. Evil Coordinate | Lionel_ZQY# | AC ✓ | 10ms | 3796kb | C++20 | 3.1kb | 2023-11-11 15:43:23 | 2023-11-11 15:43:24 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int T,mx,my;
string s,ans;
void work(int x,int y,int u,int d,int l,int r)
{
if(mx!=x)
{
for(int i=1;i<=r;i++) ans.push_back('R');
for(int i=1;i<=l;i++) ans.push_back('L');
for(int i=1;i<=u;i++) ans.push_back('U');
for(int i=1;i<=d;i++) ans.push_back('D');
}
else
{
for(int i=1;i<=u;i++) ans.push_back('U');
for(int i=1;i<=d;i++) ans.push_back('D');
for(int i=1;i<=r;i++) ans.push_back('R');
for(int i=1;i<=l;i++) ans.push_back('L');
}
}
bool solve(int u,int d,int l,int r)
{
int x=r-l,y=u-d;
if(!mx&&!my) return 0;
if(mx==x&&my==y) return 0;
ans.clear();
if(mx&&my) work(x,y,u,d,l,r);
else
{
if(!mx)
{
if(!r&&!l)
{
if(my*y>=0&&abs(my)<=abs(y)) return 0;
if(my>0)
{
for(int i=1;i<=d;i++) ans.push_back('D');
for(int i=1;i<=u;i++) ans.push_back('U');
}
else
{
for(int i=1;i<=u;i++) ans.push_back('U');
for(int i=1;i<=d;i++) ans.push_back('D');
}
}
else
{
if(r)
{
r--; ans.push_back('R');
mx--; x--;
work(x,y,u,d,l,r);
}
else
{
l--; ans.push_back('L');
mx++; x++;
work(x,y,u,d,l,r);
}
}
}
else
{
if(!u&&!d)
{
if(mx*x>=0&&abs(mx)<=abs(x)) return 0;
if(mx>0)
{
for(int i=1;i<=l;i++) ans.push_back('L');
for(int i=1;i<=r;i++) ans.push_back('R');
}
else
{
for(int i=1;i<=r;i++) ans.push_back('R');
for(int i=1;i<=l;i++) ans.push_back('L');
}
}
else
{
if(u)
{
u--; ans.push_back('U');
my--; y--;
work(x,y,u,d,l,r);
}
else
{
d--; ans.push_back('D');
my++; y++;
work(x,y,u,d,l,r);
}
}
}
}
return 1;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>T;
while(T--)
{
cin>>mx>>my>>s;
int u=0,d=0,l=0,r=0,n=s.size();
for(int i=0;i<n;i++)
{
if(s[i]=='U') u++;
if(s[i]=='D') d++;
if(s[i]=='L') l++;
if(s[i]=='R') r++;
}
if(!solve(u,d,l,r)) cout<<"Impossible\n";
else cout<<ans<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
input:
5 1 1 RURULLD 0 5 UUU 0 3 UUU 0 2 UUU 0 0 UUU
output:
RRLLUUD UUU Impossible Impossible Impossible
result:
ok 5 cases
Test #2:
score: 0
Accepted
time: 10ms
memory: 3796kb
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 URU Impossible Impossible Impossible RRUUUUUUD RRRRLDD UD Impossible RRLLLLDD RRLLUDDD Impossible UUDDDDRLL LL Impossible UUUDRRL Impossible Impossible Impossible RRRLLLLLDD Impossible RL Impossible Impossible Impossible Impossible Impossible RRRRRLLLUU LLLUD Impossible ULUUDDD UUDDRR Impossi...
result:
ok 11109 cases
Test #3:
score: 0
Accepted
time: 9ms
memory: 3780kb
input:
11107 1 0 LLRLRURLR 1 0 LLRR 0 1 R 1 0 LLLRLRRR 1 0 RUL 0 1 UD 1 0 RLRLU 0 1 DDDUUUDU 1 0 RURRLLRLL 1 0 LRLR 1 0 ULR 0 1 R 0 1 DDUUUDR 0 1 UUDDUDDU 0 1 DDUUDU 1 0 RRLRLLRLRL 1 0 RLRRLL 1 0 LUR 1 0 U 1 0 LRRRLLLR 0 1 DRUUDDUDU 0 1 DUUDDUR 1 0 LRLRLR 0 1 UUDDDUDU 0 1 R 0 1 UDUDDU 0 1 DUUDUD 1 0 RRLRRR...
output:
URRRRLLLL LLRR R LLLLRRRR URL DU URRLL DDDDUUUU URRRRLLLL LLRR URL R RUUUDDD DDDDUUUU DDDUUU LLLLLRRRRR LLLRRR URL U LLLLRRRR RUUUUDDDD RUUUDDD LLLRRR DDDDUUUU R DDDUUU DDDUUU LLLLLRRRRR DDDDUUUU DDUU URRRRLLLL DDUU LLLRRR URL URL U URL LLLRRR LLLLLRRRRR U DDDUUU R LLLRRR RUUUUDDDD RUUUUDDDD LLLRRR ...
result:
ok 11107 cases