QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#613501 | #6422. Evil Coordinate | zyq_313# | WA | 39ms | 3960kb | C++14 | 2.3kb | 2024-10-05 14:06:37 | 2024-10-05 14:09:44 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve()
{
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int x,y;cin>>x>>y;
string s;cin>>s;
string ans = "";
int len=s.size();
map<char,int> mp;
int edx=0,edy=0;
map<int, char> p;
p[0] = 'U', p[1] = 'R', p[2] = 'D', p[3] = 'L';
for(int i=0;i<s.size();i++) {
mp[s[i]]++;
if(s[i]=='R') {
edx++;
}
else if(s[i]=='L') {
edx--;
}
else if(s[i]=='U') {
edy++;
}
else {
edy--;
}
}
if (abs(x) > 100000 || abs(y) > 100000){
cout << s << endl;
return ;
}
if(edx==x&&edy==y||x==0&&y==0) {
cout<<"Impossible"<<endl;
return ;
}
int sum1=mp['R'],sum2=mp['L'],sum3=mp['U'],sum4=mp['D'];
if((sum3-sum4)>=y&&y>=0&&x==0&&sum1==0&&sum2==0) {
cout<<"Impossible"<<endl;
return ;
}
if((sum1-sum2)>=x&&x>=0&&y==0&&sum3==0&&sum4==0) {
cout<<"Impossible"<<endl;
return ;
}
if((sum4-sum3)>=abs(y)&&y<=0&&x==0&&sum1==0&&sum2==0) {
cout<<"Impossible"<<endl;
return ;
}
if((sum2-sum1)>=abs(x)&&x<=0&&y==0&&sum3==0&&sum4==0) {
cout<<"Impossible"<<endl;
return ;
}
int ex=0,ey=0;
for (int i = 0; i < s.size(); i ++){
bool f = false;
for (int j = 0; j < 4; j ++){
if (!mp[p[j]]) continue;
int tx = ex + dx[j], ty = ey + dy[j];
if (tx != x || ty != y){
f = true;
ex = tx, ey = ty;
ans += p[j];
mp[p[j]] --;
break;
}
}
if (!f) break;
}
if (ans.size() == s.size()) {
cout << ans << endl;
return ;
}
int o = -1;
for (int i = 0; i < 4; i ++){
if (mp[p[i]]){
o = i;
break;
}
}
string pp(mp[p[o]], p[o]);
pp += ans.back();
ans = pp + ans;
for (int i = 0; i < ans.size() - 1; i ++){
cout << ans[i];
}
cout << "\n";
}
int main()
{
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3808kb
input:
5 1 1 RURULLD 0 5 UUU 0 3 UUU 0 2 UUU 0 0 UUU
output:
LLDUURR UUU Impossible Impossible Impossible
result:
ok 5 cases
Test #2:
score: -100
Wrong Answer
time: 39ms
memory: 3960kb
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:
UURRDD UUR Impossible Impossible Impossible UUUUUURRD RRRRDDL UD Impossible RRDDLLLL URRDDDLL Impossible UURDDDDLL LL Impossible UUURRDL Impossible Impossible Impossible LLLLRRRDDL Impossible RL Impossible Impossible Impossible Impossible Impossible URURRRRLLL UDLLL Impossible UUUDDDL UURRDD Impossi...
result:
wrong answer case 1288, participant's output goes through forbidden coordinate