QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #506161 | #6422. Evil Coordinate | ssmy | WA | 15ms | 3764kb | C++20 | 3.6kb | 2024-08-05 15:45:52 | 2024-08-05 15:45:52 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> PII;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int x, y;
map <char, int> mt;
void solve()
{
std:: cin >> x >> y;
string s;
std:: cin >> s;
if(x == 0 && y == 0)
{
std:: cout << "Impossible" << endl;
return ;
}
int m = 0, n = 0;
for(int i = 0; i < s.length(); i ++ )
{
m += dx[mt[s[i]]];
n += dy[mt[s[i]]];
}
if(m == x && n == y)
{
std:: cout << "Impossible" << endl;
return ;
}
map <char, int> l;
for(int i = 0; i < s.length(); i ++ )
{
l[s[i]] ++ ;
}
if(l[s[0]] == s.length())
{
m = 0, n = 0;
for(int i = 0; i < s.length(); i ++ )
{
m += dx[mt[s[i]]];
n += dy[mt[s[i]]];
if(m == x && n == y && l[s[0]] == s.length())
{
std:: cout << "Impossible" << endl;
return ;
}
}
}
int tx = 0, ty = 0;
if(x != m)
{
if(x >= 0)
{
for(int i = 0; i < l['L']; i ++ )
{
std:: cout << 'L';
}
for(int j = 0; j < l['R']; j ++ )
{
std:: cout << 'R';
}
}
else
{
for(int j = 0; j < l['R']; j ++ )
{
std:: cout << 'R';
}
for(int i = 0; i < l['L']; i ++ )
{
std:: cout << 'L';
}
}
if(y >= 0)
{
for(int i = 0; i < l['D']; i ++ )
{
std:: cout << 'D';
}
for(int i = 0; i < l['U']; i ++ )
{
std:: cout << "U";
}
}
else
{
for(int i = 0; i < l['U']; i ++ )
{
std:: cout << "U";
}
for(int i = 0; i < l['D']; i ++ )
{
std:: cout << 'D';
}
}
std:: cout << endl;
}
else if(y != n)
{
if(y >= 0)
{
for(int i = 0; i < l['D']; i ++ )
{
std:: cout << 'D';
}
for(int i = 0; i < l['U']; i ++ )
{
std:: cout << "U";
}
}
else
{
for(int i = 0; i < l['U']; i ++ )
{
std:: cout << "U";
}
for(int i = 0; i < l['D']; i ++ )
{
std:: cout << 'D';
}
}
if(x >= 0)
{
for(int i = 0; i < l['L']; i ++ )
{
std:: cout << 'L';
}
for(int j = 0; j < l['R']; j ++ )
{
std:: cout << 'R';
}
}
else
{
for(int j = 0; j < l['R']; j ++ )
{
std:: cout << 'R';
}
for(int i = 0; i < l['L']; i ++ )
{
std:: cout << 'L';
}
}
std:: cout << endl;
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
mt['U'] = 0;
mt['L'] = 3;
mt['R'] = 1;
mt['D'] = 2;
int T;
std:: 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: 3552kb
input:
5 1 1 RURULLD 0 5 UUU 0 3 UUU 0 2 UUU 0 0 UUU
output:
LLRRDUU UUU Impossible Impossible Impossible
result:
ok 5 cases
Test #2:
score: -100
Wrong Answer
time: 15ms
memory: 3764kb
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:
RRDDUU RUU Impossible Impossible Impossible RRDUUUUUU RRRRLDD DU Impossible LLLLRRDD LLRRUDDD Impossible DDDDUURLL LL Impossible DUUULRR Impossible Impossible Impossible LLLLLRRRDD Impossible RL Impossible Impossible Impossible Impossible Impossible LLLRRRRRUU LLLUD Impossible LDDDUUU UUDDRR Impossi...
result:
wrong answer case 116, participant's output goes through forbidden coordinate