QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#612759 | #6422. Evil Coordinate | dyfhpu | WA | 44ms | 3952kb | C++17 | 2.3kb | 2024-10-05 12:49:58 | 2024-10-05 12:49:59 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
void solve()
{
int x,y;cin>>x>>y;
string s;cin>>s;
string ans = "";
int len=s.size();
map<char,int> mp;
int edx=0,edy=0;
map<int, char> p;
p[0] = 'U', p[1] = 'R', p[2] = 'D', p[3] = 'L';
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&&y>=0&&x==0&&sum1==0&&sum2==0) {
cout<<"Impossible"<<endl;
return ;
}
if((sum1-sum2)>=x&&x>=0&&y==0&&sum3==0&&sum4==0) {
cout<<"Impossible"<<endl;
return ;
}
if((sum4-sum3)>=abs(y)&&y<=0&&x==0&&sum1==0&&sum2==0) {
cout<<"Impossible"<<endl;
return ;
}
if((sum2-sum1)>=abs(x)&&x<=0&&y==0&&sum3==0&&sum4==0) {
cout<<"Impossible"<<endl;
return ;
}
int ex=0,ey=0;
for (int i = 0; i < s.size(); i ++){
for (int j = 0; j < 4; j ++){
// if (i == 2){
// cout << j << endl;
// }
if (!mp[p[j]]) continue;
int tx = ex + dx[j], ty = ey + dy[j];
if (tx != x || ty != y){
ex = tx, ey = ty;
ans += p[j];
mp[p[j]] --;
swap(p[0], p[2]);
swap(p[1], p[3]);
swap(dx[0], dx[2]);
swap(dx[1], dx[3]);
swap(dy[0], dy[2]);
swap(dy[1], dy[3]);
break;
}
// reverse(a, a + n);
}
// cout << ex << ' ' << ey << endl;
}
// for (int i = 0; i < 4; i ++) cout << p[i] << ' ' << mp[p[i]] << endl;
cout << ans << 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: 3604kb
input:
5 1 1 RURULLD 0 5 UUU 0 3 UUU 0 2 UUU 0 0 UUU
output:
UDULRLR UUU Impossible Impossible Impossible
result:
ok 5 cases
Test #2:
score: -100
Wrong Answer
time: 44ms
memory: 3952kb
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:
UDUDRR UUR Impossible Impossible Impossible UDUUUUURR RDRDRLR UD Impossible RDRDLLLL UDRDRDLL Impossible UDUDDDRLL LL Impossible UDULURR Impossible Impossible Impossible RDRDRLLLLL Impossible RL Impossible Impossible Impossible Impossible Impossible ULULRLRRRR UDLLL Impossible UDUDUDL UDUDRR Impossi...
result:
wrong answer case 20, participant's output goes through forbidden coordinate