QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#692185 | #6422. Evil Coordinate | atzk# | AC ✓ | 10ms | 3944kb | C++20 | 2.6kb | 2024-10-31 13:59:54 | 2024-10-31 13:59:55 |
Judging History
answer
# include <bits/stdc++.h>
using namespace std;
# ifndef ONLINE_JUDGE
# include "debug.h"
# else
# define debug(...) 0721
# define ps 0721
# endif
using i32 = signed;
using i64 = long long;
void solve() {
array<int, 4> cnt{};
array<int, 2> v{};
cin >> v[0] >> v[1];
string s;
cin >> s;
for (char v : s) {
if (v == 'U') {
cnt[0] ++;
} else if (v == 'D') {
cnt[1] ++;
} else if (v == 'L') {
cnt[2] ++;
} else {
cnt[3] ++;
}
}
array<int, 4> ord{};
iota(ord.begin(), ord.end(), 0);
bool finded = false;
do {
array<int, 2> u{};
bool ok = true;
for (auto c : ord) {
if (c == 0) {
if (u[0] == v[0] && u[1] <= v[1] && v[1] <= u[1] + cnt[c]) {
ok = false;
break;
}
u[1] += cnt[c];
} else if (c == 1) {
if (u[0] == v[0] && u[1] - cnt[c] <= v[1] && v[1] <= u[1]) {
ok = false;
break;
}
u[1] -= cnt[c];
} else if (c == 2) {
if (u[0] - cnt[c] <= v[0] && v[0] <= u[0] && u[1] == v[1]) {
ok = false;
break;
}
u[0] -= cnt[c];
} else {
if (u[0] <= v[0] && v[0] <= u[0] + cnt[c] && u[1] == v[1]) {
ok = false;
break;
}
u[0] += cnt[c];
}
}
if (ok) {
finded = true;
break;
}
} while (next_permutation(ord.begin(), ord.end()));
if (finded) {
string s;
for (auto c : ord) {
if (c == 0) {
s += string(cnt[c], 'U');
} else if (c == 1) {
s += string(cnt[c], 'D');
} else if (c == 2) {
s += string(cnt[c], 'L');
} else {
s += string(cnt[c], 'R');
}
}
cout << s;
} else {
cout << "Impossible";
}
}
i32 main() {
ios::sync_with_stdio(0);
cin.tie(0);
# ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
freopen("Error.txt", "w", stderr);
# endif
i32 t = 1;
cin >> t;
while (t --) {
solve();
if (t != 0) {
cout << '\n';
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3548kb
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: 10ms
memory: 3892kb
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: 2ms
memory: 3944kb
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