QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#198952 | #6422. Evil Coordinate | qzhwlzy | WA | 13ms | 3888kb | C++14 | 1.1kb | 2023-10-03 19:32:41 | 2023-10-03 19:32:41 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 100005
using namespace std;
int T,ax,ay,n,a[maxn]; char s[maxn]; int p[5],num[5];
void print(){
for(int i=1;i<=4;i++){
if(p[i]==1) for(int j=1;j<=a[1];j++) printf("U");
if(p[i]==2) for(int j=1;j<=a[2];j++) printf("D");
if(p[i]==3) for(int j=1;j<=a[3];j++) printf("L");
if(p[i]==4) for(int j=1;j<=a[4];j++) printf("R");
} printf("\n");
}
int main(){
scanf("%d",&T); while(T--){
scanf("%d%d%s",&ax,&ay,s+1); a[1]=a[2]=a[3]=a[4]=0; n=strlen(s+1);
for(int i=1;i<=n;i++) if(s[i]=='U') a[1]++; else if(s[i]=='D') a[2]++; else if(s[i]=='L') a[3]++; else a[4]++;
p[1]=1; p[2]=2; p[3]=3; p[4]=4; bool ifans=0; do{
int x=0,y=0; bool flag=0;
for(int i=1;i<=4;i++){
int nx=x,ny=y; if(p[i]==1) ny+=a[1],flag|=(ax==nx&&ay>=y&&ay<=ny);
else if(p[i]==2) ny-=a[2],flag|=(ax==nx&&ay>=ny&&ay<=y);
else if(p[i]==3) nx-=a[3],flag|=(ay==ny&&ax>=nx&&ax<=x);
else nx+=a[4],flag|=(ay==ny&&ax>=x&&ax<=nx);
} if(!flag){print(); ifans=1; break;}
}while(next_permutation(p+1,p+5)); if(ifans==0) printf("Impossible\n");
} return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3800kb
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: -100
Wrong Answer
time: 13ms
memory: 3888kb
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 UUUUDDDLLR UUUUUUDRR DDLRRRR UD Impossible DDLLLLRR UDDDLLRR Impossible Impossible LL UUDDDLLLRR UUUDLRR Impossible Impossible Impossible Impossible Impossible LR Impossible Impossible Impossible Impossible Impossible Impossible UDLLL Impossible UUUDDDL UUDDRR Imposs...
result:
wrong answer case 5, participant's output goes through forbidden coordinate