QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #648091 | #6422. Evil Coordinate | shabi666# | WA | 11ms | 3796kb | C++20 | 4.9kb | 2024-10-17 16:59:26 | 2024-10-17 16:59:27 |
Judging History
answer
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
const int N = 1e6 + 5;
void solve() {
int x, y;
cin >> x >> y;
string s;
cin >> s;
map<char, int> cnt;
int ex = 0, ey = 0;
for (char c : s) {
cnt[c]++;
}
ey = cnt['U'] - cnt['D'];
ex = cnt['R'] - cnt['L'];
int eex = ex, eey = ey;
// cerr << ex << ' ' << ey << endl;
if (x == 0 && y == 0 || x == ex && y == ey) {
cout << "Impossible" << endl;
return;
}
if ( ex == 0 || ey == 0 ) {
if ( cnt['L'] == 0 && cnt['R'] == 0 ) {
if ( abs(y) <= abs(ey) && y * ey >= 0 ) {
cout << "Impossible" << endl;
return;
}
} else if ( cnt['U'] == 0 && cnt['D'] == 0 ) {
if ( abs(x) <= abs(ex) && x * ex >= 0 ) {
cout << "Impossible" << endl;
return;
}
}
if (x == 0 && ex == 0 && abs(y) <= abs(ey) && y * ey >= 0 ) {
cout << "R";
cnt['R']--;
cnt['L']--;
while ( ex > 0 ) { cout << 'R'; ex--; cnt['R']--; }
while ( ex < 0 ) { cout << 'L'; ex++; cnt['L']--; }
while ( ey > 0 ) { cout << 'U'; ey--; cnt['U']--; }
while ( ey < 0 ) { cout << 'D'; ey++; cnt['D']--; }
while ( cnt['R'] > 0 ) { cout << "RL"; cnt['R']--; cnt['L']--; }
while ( cnt['U'] > 0 ) { cout << "DU"; cnt['U']--; cnt['D']--; }
cout << 'L';
cout << endl;
}
else if (y == 0 && ey == 0 && abs(x) <= abs(ex) && x * ex >= 0 ) {
cout << "U";
cnt['U']--;
cnt['D']--;
while ( ex > 0 ) { cout << 'R'; ex--; cnt['R']--; }
while ( ex < 0 ) { cout << 'L'; ex++; cnt['L']--; }
while ( ey > 0 ) { cout << 'U'; ey--; cnt['U']--; }
while ( ey < 0 ) { cout << 'D'; ey++; cnt['D']--; }
while ( cnt['U'] > 0 ) { cout << "UD"; cnt['U']--; cnt['D']--; }
while ( cnt['R'] > 0 ) { cout << "RL"; cnt['R']--; cnt['L']--; }
cout << 'D';
cout << endl;
}
else {
while ( ex > 0 ) { cout << 'R'; ex--; cnt['R']--; }
while ( ex < 0 ) { cout << 'L'; ex++; cnt['L']--; }
while ( ey > 0 ) { cout << 'U'; ey--; cnt['U']--; }
while ( ey < 0 ) { cout << 'D'; ey++; cnt['D']--; }
if ( eex + 1 == x && eey == y ) while ( cnt['R'] > 0 ) { cout << "LR"; cnt['R']--; cnt['L']--; }
else while ( cnt['R'] > 0 ) { cout << "RL"; cnt['R']--; cnt['L']--; }
if ( eey + 1 == y && eex == x ) while ( cnt['U'] > 0 ) { cout << "DU"; cnt['U']--; cnt['D']--; }
else while ( cnt['U'] > 0 ) { cout << "UD"; cnt['U']--; cnt['D']--; }
cout << endl;
}
return;
}
if ( y == 0 && abs(x) <= abs(ex) && x * ex >= 0 || x == ex && abs(y) <= abs(ey) && y * ey >= 0 ) {
while ( ey > 0 ) { cout << 'U'; ey--; cnt['U']--; }
while ( ey < 0 ) { cout << 'D'; ey++; cnt['D']--; }
while ( ex > 0 ) { cout << 'R'; ex--; cnt['R']--; }
while ( ex < 0 ) { cout << 'L'; ex++; cnt['L']--; }
if ( eex + 1 == x && eey == y ) while ( cnt['R'] > 0 ) { cout << "LR"; cnt['R']--; cnt['L']--; }
else while ( cnt['R'] > 0 ) { cout << "RL"; cnt['R']--; cnt['L']--; }
if ( eey + 1 == y && eex == x ) while ( cnt['U'] > 0 ) { cout << "DU"; cnt['U']--; cnt['D']--; }
else while ( cnt['U'] > 0 ) { cout << "UD"; cnt['U']--; cnt['D']--; }
cout << endl;
return;
}
while ( ex > 0 ) { cout << 'R'; ex--; cnt['R']--; }
while ( ex < 0 ) { cout << 'L'; ex++; cnt['L']--; }
while ( ey > 0 ) { cout << 'U'; ey--; cnt['U']--; }
while ( ey < 0 ) { cout << 'D'; ey++; cnt['D']--; }
if ( eex + 1 == x && eey == y ) while ( cnt['R'] > 0 ) { cout << "LR"; cnt['R']--; cnt['L']--; }
else while ( cnt['R'] > 0 ) { cout << "RL"; cnt['R']--; cnt['L']--; }
if ( eey + 1 == y && eex == x ) while ( cnt['U'] > 0 ) { cout << "DU"; cnt['U']--; cnt['D']--; }
else while ( cnt['U'] > 0 ) { cout << "UD"; cnt['U']--; cnt['D']--; }
cout << endl;
}
void check(string path, int x, int y) {
int xx = 0, yy = 0;
for (char c : path) {
if (c == 'U')
yy++;
if (c == 'D')
yy--;
if (c == 'L')
xx--;
if (c == 'R')
xx++;
if (xx == x && yy == y) {
cout << "ERROR" << endl;
return;
}
}
}
signed main() {
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int T = 1;
cin >> T;
while (T--) solve();
//check("RRUUUUUUUURLRLRLUDUDUD", 4, 1);
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3628kb
input:
5 1 1 RURULLD 0 5 UUU 0 3 UUU 0 2 UUU 0 0 UUU
output:
ULRLRUD UUU Impossible Impossible Impossible
result:
ok 5 cases
Test #2:
score: -100
Wrong Answer
time: 11ms
memory: 3796kb
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 RRUUUUUUD RRRDDRL Impossible Impossible LLDDRLRL DDRLRLUD Impossible DDLRLUDUD LL Impossible RUURLUD Impossible Impossible Impossible LLDDRLRLRL Impossible RL Impossible Impossible Impossible Impossible Impossible RRUURLRLRL LLLUD Impossible LUDUDUD RRUDUD...
result:
wrong answer case 8, participant does not find an answer but the jury does