QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #506166 | #6422. Evil Coordinate | Umok | WA | 12ms | 3976kb | C++20 | 3.9kb | 2024-08-05 15:46:51 | 2024-08-05 15:46:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
const int N = 2e5 + 5;
#define int long long
typedef pair<int, int> PII;
#define MAX LONG_LONG_MAX
#define mod 10007
#define eps 1e-7
int l, r, d, u, a, b;
void solve()
{
l = d = r = u = 0;
string s;
cin >> a >> b;
cin >> s;
for (char c : s)
{
if (c == 'L')
l++;
else if (c == 'R')
r++;
else if (c == 'U')
u++;
else
d++;
}
int x = r - l, y = u - d;
if (x == a && y == b || a == 0 && b == 0)
{
cout << "Impossible" << endl;
return;
}
if (x == a && a == 0)
{
if ((y >= b && b > 0) || (y <= b && b < 0))
{
cout << "Impossible" << endl;
return;
}
}
else if (b == y && b == 0)
{
if ((x >= a && a > 0) || (x <= a && a < 0))
{
cout << "Impossible" << endl;
return;
}
}
if (a == 0)
{
if (u)
{
cout << "U";
u--;
}
else if (d)
{
cout << "D";
d--;
}
}
else if(b)
{
if(l)
{
cout << "L";
l--;
}else if(r)
{
cout << "R";
r--;
}
}
if (a == x)
{
if (b > 0)
{
for (int i = 1; i <= min(d, u); i++)
cout << "DU";
for (int i = min(d, u) + 1; i <= d; i++)
cout << "D";
for (int i = min(d, u) + 1; i <= u; i++)
cout << "U";
}
else
{
for (int i = 1; i <= min(d, u); i++)
cout << "UD";
for (int i = min(d, u) + 1; i <= u; i++)
cout << "U";
for (int i = min(d, u) + 1; i <= d; i++)
cout << "D";
}
if (a > 0)
{
for (int i = 1; i <= min(l, r); i++)
cout << "LR";
for (int i = min(l, r) + 1; i <= l; i++)
cout << "L";
for (int i = min(l, r) + 1; i <= r; i++)
cout << "R";
}
else
{
for (int i = 1; i <= min(l, r); i++)
cout << "RL";
for (int i = min(l, r) + 1; i <= r; i++)
cout << "R";
for (int i = min(l, r) + 1; i <= l; i++)
cout << "L";
}
}
else
{
if (a > 0)
{
for (int i = 1; i <= min(l, r); i++)
cout << "LR";
for (int i = min(l, r) + 1; i <= l; i++)
cout << "L";
for (int i = min(l, r) + 1; i <= r; i++)
cout << "R";
}
else
{
for (int i = 1; i <= min(l, r); i++)
cout << "RL";
for (int i = min(l, r) + 1; i <= r; i++)
cout << "R";
for (int i = min(l, r) + 1; i <= l; i++)
cout << "L";
}
if (b > 0)
{
for (int i = 1; i <= min(d, u); i++)
cout << "DU";
for (int i = min(d, u) + 1; i <= d; i++)
cout << "D";
for (int i = min(d, u) + 1; i <= u; i++)
cout << "U";
}
else
{
for (int i = 1; i <= min(d, u); i++)
cout << "UD";
for (int i = min(d, u) + 1; i <= u; i++)
cout << "U";
for (int i = min(d, u) + 1; i <= d; i++)
cout << "D";
}
}
cout << endl;
}
signed main()
{
IOS;
int t;
cin >> t;
while (t--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3596kb
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: 12ms
memory: 3976kb
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:
RRUDUD RUU Impossible Impossible Impossible RRDUUUUUU LRRRRDD UD Impossible LLRLRLDD LLRRUDDD Impossible UDUDDDRLL LL Impossible LDUUURR Impossible Impossible Impossible DRLRLRLLLD Impossible RL Impossible Impossible Impossible Impossible Impossible URLRLRLRRU LLLUD Impossible LUDUDUD RUDUDR Impossi...
result:
wrong answer case 57, participant's output goes through forbidden coordinate