QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#506730 | #6422. Evil Coordinate | mmzskm | AC ✓ | 27ms | 4072kb | C++20 | 1.5kb | 2024-08-05 20:58:22 | 2024-08-05 20:58:25 |
Judging History
answer
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<map>
using namespace std;
int mx, my;
int a[4] = { 0,1,2,3 };//U D L R
int cnt[4] = { 0 };
int op[4][2] = { {0,1},{0,-1},{-1,0},{1,0} };
bool check()
{
int x = 0, y = 0;
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < cnt[a[i]]; j++)
{
x += op[a[i]][0];
y += op[a[i]][1];
if (x == mx && y == my) return false;
}
}
return true;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
map<int, string>mp;
mp[0] = 'U'; mp[1] = 'D';
mp[2] = 'L'; mp[3] = 'R';
while (t--) {
cin >> mx >> my;
string s;
cin >> s;
int x = 0, y = 0;
memset(cnt, 0, sizeof(cnt));
a[0] = 0, a[1] = 1, a[2] = 2, a[3] = 3;
for (int i = 0; i < s.size(); i++)
{
if (s[i] == 'U')
{
cnt[0]++; y++;
}
if (s[i] == 'D')
{
cnt[1]++; y--;
}
if (s[i] == 'L')
{
cnt[2]++; x--;
}
if (s[i] == 'R')
{
cnt[3]++; x++;
}
}
if ((mx == 0 && my == 0) || (x == mx && y == my))
{
cout << "Impossible\n";
continue;
}
bool ok = false;
do {
if (check())
{
ok = true;
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < cnt[a[i]]; j++)
cout << mp[a[i]];
}
cout << endl;
break;
}
} while (next_permutation(a, a + 4));
if (!ok)
{
cout << "Impossible\n";
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3776kb
input:
5 1 1 RURULLD 0 5 UUU 0 3 UUU 0 2 UUU 0 0 UUU
output:
UUDLLRR UUU Impossible Impossible Impossible
result:
ok 5 cases
Test #2:
score: 0
Accepted
time: 16ms
memory: 4072kb
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:
UUDDRR UUR Impossible Impossible Impossible UUUUUUDRR DDLRRRR UD Impossible DDLLLLRR UDDDLLRR Impossible UUDDDDLLR LL Impossible UUUDLRR Impossible Impossible Impossible LLLLLDDRRR Impossible LR Impossible Impossible Impossible Impossible Impossible LLLRRRRRUU UDLLL Impossible UUUDDDL UUDDRR Impossi...
result:
ok 11109 cases
Test #3:
score: 0
Accepted
time: 27ms
memory: 3876kb
input:
11107 1 0 LLRLRURLR 1 0 LLRR 0 1 R 1 0 LLLRLRRR 1 0 RUL 0 1 UD 1 0 RLRLU 0 1 DDDUUUDU 1 0 RURRLLRLL 1 0 LRLR 1 0 ULR 0 1 R 0 1 DDUUUDR 0 1 UUDDUDDU 0 1 DDUUDU 1 0 RRLRLLRLRL 1 0 RLRRLL 1 0 LUR 1 0 U 1 0 LRRRLLLR 0 1 DRUUDDUDU 0 1 DUUDDUR 1 0 LRLRLR 0 1 UUDDDUDU 0 1 R 0 1 UDUDDU 0 1 DUUDUD 1 0 RRLRRR...
output:
ULLLLRRRR LLRR R LLLLRRRR ULR DU ULLRR DDDDUUUU ULLLLRRRR LLRR ULR R DDDUUUR DDDDUUUU DDDUUU LLLLLRRRRR LLLRRR ULR U LLLLRRRR DDDDUUUUR DDDUUUR LLLRRR DDDDUUUU R DDDUUU DDDUUU LLLLLRRRRR DDDDUUUU DDUU ULLLLRRRR DDUU LLLRRR ULR ULR U ULR LLLRRR LLLLLRRRRR U DDDUUU R LLLRRR DDDDUUUUR DDDDUUUUR LLLRRR ...
result:
ok 11107 cases