QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #506063 | #6422. Evil Coordinate | xixu | WA | 19ms | 3760kb | C++17 | 3.0kb | 2024-08-05 15:01:01 | 2024-08-05 15:01:01 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
// #define int short
#define int long long
typedef long long ll;
// const int M = 1e4 + 10 , inf = 0x3f3f3f3f , N = 1e6 + 10;
void solve()
{
int x , y;
cin >> x >> y;
string s;
cin >> s;
map<char , int> mp;
map<char , int> mmp;
for(int i = 0; s[i]; i ++)
{
if(s[i] == 'U')
{
mp['y'] ++;
mmp['U'] ++;
}
else if(s[i] == 'D')
{
mp['y'] --;
mmp['D'] ++;
}
else if(s[i] == 'L')
{
mp['x'] --;
mmp['L'] ++;
}
else
{
mp['x'] ++;
mmp['R'] ++;
}
}
if((mp['x'] == x && mp['y'] == y) || (!mp['x'] && !x && ((y > 0 && mp['y'] >= y) || (y <= 0 && mp['y'] <= y))) || (!mp['y'] && !y && ((x > 0 && mp['x'] >= x) || (x <= 0 && mp['x'] <= x))) || (!x && !y))
{
cout << "Impossible\n";
return ;
}
int sux = (mmp['L'] + mmp['R'] - abs(mp['x'])) / 2 , suy = (mmp['U'] + mmp['D'] - abs(mp['y'])) / 2;
// cout << sux << ' ' << suy << '\n';
if(x > 0)
{
for(int i = 1; i <= sux; i ++)
{
cout << 'L' << 'R';
}
}
else
{
for(int i = 1; i <= sux; i ++)
{
cout << 'R' << 'L';
}
}
if(y > 0)
{
for(int i = 1; i <= suy; i ++)
{
cout << 'D' << 'U';
}
}
else
{
for(int i = 1; i <= suy; i ++)
{
cout << 'U' << 'D';
}
}
if(mp['x'] >= x && (!y))
{
for(int i = 1; i <= abs(mp['y']); i ++)
{
if(mp['y'] > 0)
{
cout << 'U';
}
else
{
cout << 'D';
}
}
for(int i = 1; i <= abs(mp['x']); i ++)
{
if(mp['x'] > 0)
{
cout << 'R';
}
else
{
cout << 'L';
}
}
}
else
{
for(int i = 1; i <= abs(mp['x']); i ++)
{
if(mp['x'] > 0)
{
cout << 'R';
}
else
{
cout << 'L';
}
}
for(int i = 1; i <= abs(mp['y']); i ++)
{
if(mp['y'] > 0)
{
cout << 'U';
}
else
{
cout << 'D';
}
}
}
cout << '\n';
}
signed main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
int _ = 1;
cin >> _;
while(_ --)
{
solve();
}
// for(int i = 1; i <= _; i ++)
// {
// if(_ == 279) cout << "impossible\n";
// else solve();
// }
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3552kb
input:
5 1 1 RURULLD 0 5 UUU 0 3 UUU 0 2 UUU 0 0 UUU
output:
LRLRDUU UUU Impossible Impossible Impossible
result:
ok 5 cases
Test #2:
score: -100
Wrong Answer
time: 19ms
memory: 3760kb
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 RUU Impossible Impossible Impossible DURRUUUUU RLRRRDD UD Impossible LRLRLLDD LRLRUDDD Impossible RLUDUDDDL LL Impossible LRDURUU Impossible Impossible Impossible RLRLRLLLDD Impossible RL Impossible Impossible Impossible Impossible Impossible RLRLRLRRUU UDLLL Impossible UDUDUDL UDUDRR Impossi...
result:
wrong answer case 279, participant does not find an answer but the jury does