QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #506020 | #6422. Evil Coordinate | ssmy | WA | 13ms | 4044kb | C++20 | 5.4kb | 2024-08-05 14:44:38 | 2024-08-05 14:44:38 |
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;
void pd()
{
}
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;
bool is = true;
for(int i = 0; i < s.length(); i ++ )
{
m += dx[mt[s[i]]];
n += dy[mt[s[i]]];
if(m == x && n == y)
{
is = false;
}
}
if(is)
{
std:: cout << s << endl;
return ;
}
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 == 0)
{
if(x >= 0)
{
for(int i = 0; i < l['L']; i ++ )
{
pd();
std:: cout << 'L';
}
for(int j = 0; j < l['R']; j ++ )
{
pd();
std:: cout << 'R';
}
}
else
{
for(int j = 0; j < l['R']; j ++ )
{
pd();
std:: cout << 'R';
}
for(int i = 0; i < l['L']; i ++ )
{
pd();
std:: cout << 'L';
}
}
if(y >= 0)
{
for(int i = 0; i < l['D']; i ++ )
{
pd();
std:: cout << 'D';
}
for(int i = 0; i < l['U']; i ++ )
{
pd();
std:: cout << "U";
}
}
else
{
for(int i = 0; i < l['U']; i ++ )
{
pd();
std:: cout << "U";
}
for(int i = 0; i < l['D']; i ++ )
{
pd();
std:: cout << 'D';
}
}
std:: cout << endl;
}
else if(y == 0)
{
if(y >= 0)
{
for(int i = 0; i < l['D']; i ++ )
{
pd();
std:: cout << 'D';
}
for(int i = 0; i < l['U']; i ++ )
{
pd();
std:: cout << "U";
}
}
else
{
for(int i = 0; i < l['U']; i ++ )
{
pd();
std:: cout << "U";
}
for(int i = 0; i < l['D']; i ++ )
{
pd();
std:: cout << 'D';
}
}
if(x >= 0)
{
for(int i = 0; i < l['L']; i ++ )
{
pd();
std:: cout << 'L';
}
for(int j = 0; j < l['R']; j ++ )
{
pd();
std:: cout << 'R';
}
}
else
{
for(int j = 0; j < l['R']; j ++ )
{
pd();
std:: cout << 'R';
}
for(int i = 0; i < l['L']; i ++ )
{
pd();
std:: cout << 'L';
}
}
std:: cout << endl;
}
else
{
if(x >= 0)
{
for(int i = 0; i < l['L']; i ++ )
{
pd();
std:: cout << 'L';
}
for(int j = 0; j < l['R']; j ++ )
{
pd();
std:: cout << 'R';
}
}
else
{
for(int j = 0; j < l['R']; j ++ )
{
pd();
std:: cout << 'R';
}
for(int i = 0; i < l['L']; i ++ )
{
pd();
std:: cout << 'L';
}
}
if(y >= 0)
{
for(int i = 0; i < l['D']; i ++ )
{
pd();
std:: cout << 'D';
}
for(int i = 0; i < l['U']; i ++ )
{
pd();
std:: cout << "U";
}
}
else
{
for(int i = 0; i < l['U']; i ++ )
{
pd();
std:: cout << "U";
}
for(int i = 0; i < l['D']; i ++ )
{
pd();
std:: cout << 'D';
}
}
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;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3536kb
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: 13ms
memory: 4044kb
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:
RUDUDR URU Impossible Impossible Impossible RRUUUDUUU RRDRLDR UD Impossible LDDLLLRR LDRURLDD Impossible DUDDLLRDU LL Impossible URDULUR Impossible Impossible Impossible LDLRLLDRRL Impossible RL Impossible Impossible Impossible Impossible Impossible LRURRLLRRU LLUDL Impossible UUDDDLU RURUDD Impossi...
result:
wrong answer case 116, participant's output goes through forbidden coordinate