QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#333333	#7751. Palindrome Path	wullaaa	WA	1ms	3936kb	C++14	1.4kb	2024-02-19 20:15:36	2024-02-19 20:15:37

Judging History

你现在查看的是最新测评结果

[2024-02-19 20:15:37]
评测

测评结果：WA
用时：1ms
内存：3936kb

查看

[2024-02-19 20:15:36]
提交

answer

#include<bits/stdc++.h>
using namespace std;
int n,m,cnt,a[35][35],s1,s2,t1,t2;
bool vis[35][35];
int step_x[4]={0,0,1,-1},step_y[4]={1,-1,0,0};
char s[4]={'R','L','D','U'};
string ans;
void check(int x,int y){
    if(!a[x][y]||vis[x][y]) return ;
    --cnt,vis[x][y]=true;
    for(int i=0;i<4;++i) check(x+step_x[i],y+step_y[i]);
}
void work(int k){
    for(int i=1;;++i){
        if(!a[t1+i*step_x[k]][t2+i*step_y[k]]){
            ans+=string(i-1,s[k^1])+string(i,s[k]);
            break;
        }
        if(!a[s1-i*step_x[k]][s2-i*step_y[k]]){
            ans+=string(i,s[k^1])+string(i,s[k]);
            break;
        }
    }
    s1+=step_x[k],s2+=step_y[k];
}
void solve(int k){
    vis[s1][s2]=true;
    if(k&&abs(s1-t1)+abs(s2-t2)<2){
        cout<<ans;
        if(s1==t1+1) putchar('L');
        if(s1==t1-1) putchar('R');
        if(s2==t2+1) putchar('U');
        if(s2==t2-1) putchar('D');
        reverse(begin(ans),end(ans));
        cout<<ans; exit(0);
    }
    for(int i=0;i<4;++i) if(a[s1+step_x[i]][s2+step_y[i]]&&!vis[s1+step_x[i]][s2+step_y[i]]) work(i),solve(k),work(i^1);
    
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i){ getchar(); for(int j=1;j<=m;++j) cnt+=(a[i][j]=getchar()-'0'); }
    scanf("%d%d%d%d",&s1,&s2,&t1,&t2);
    check(s1,s2);
    if(cnt) return puts("-1"),0;
    memset(vis,0,sizeof(vis)),solve(0);
    memset(vis,0,sizeof(vis)),solve(1);


    return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3668kb

input:

output:

RDRLRDURLRRRLRUDRLRDR

result:

ok Valid Solution (Length = 21).

Test #2:

score: 0

Accepted

time: 0ms

memory: 3648kb

input:

output:

-1

result:

ok No Solution.

Test #3:

score: 0

Accepted

time: 0ms

memory: 3584kb

input:

1 1
1
1 1 1 1

output:

result:

ok Valid Solution (Length = 0).

Test #4:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

output:

LLRRLLRRRUDDRLRLLRLLDUDDUULRLLRRLLRRRDDDUUURLRLLRLLDDDUUUULRLLRRLLRRRRLRLLRLLUDLRLLRRLLRRRUDDRLRLLRLLUDDUDDLRLLRRLLRRRDURLRLLLLRLRUDRRRLLRRLLRLDDUDDULLRLLRLRDDURRRLLRRLLRLDULLRLLRLRRRRLLRRLLRLUUUUDDDLLRLLRLRUUUDDDRRRLLRRLLRLUUDDUDLLRLLRLRDDURRRLLRRLL

result:

ok Valid Solution (Length = 250).

Test #5:

score: 0

Accepted

time: 0ms

memory: 3936kb

input:

output:

RDDRLRRLLRRRLLLRRRRLLLLDDRRRRDUDRLRRLLDUDRRRLLLRRRRLLLLDUDDUUDDDUUUDDDDUUUURRDDDDDUUUURRRLLLRRRRLLLLDDRRRRDDDUUUDDDDUUUURLRDDRLRRLLRRRLLLRRRRLLLLDDRRRDRRRDDLLLLRRRRLLLRRRLLRRLRDDRLRUUUUDDDDUUUDDDRRRRDDLLLLRRRRLLLRRRUUUUDDDDDRRUUUUDDDDUUUDDDUUDDUDLLLLRRRRLLLRRRDUDLLRRLRDUDRRRRDDLLLLRRRRLLLRRRLLRRLRDDR

result:

ok Valid Solution (Length = 301).

Test #6:

score: 0

Accepted

time: 0ms

memory: 3672kb

input:

output:

DRLRLLLRLRRUURLRLLUULRLRRRLRLLDDLRLRRDDRLRLLLRLRRUUUUURRLRLLLRLRDDRRLRLDDLLRLRRRLRLUULLRLRUURRLRLLLRLRD

result:

ok Valid Solution (Length = 103).

Test #7:

score: 0

Accepted

time: 0ms

memory: 3676kb

input:

output:

LUUDDRRRUUDDDLUUDDURUUUUDUUDDLLLUUUDRLLLRDUUULLLDDUUDUUUURUDDUULDDDUURRRDDUUL

result:

ok Valid Solution (Length = 77).

Test #8:

score: 0

Accepted

time: 0ms

memory: 3684kb

input:

output:

LRLRRRLRLLDUUULRLRRUDRLRLLUDDDLRLRRRLRLLDUUUDUUUDLLRLRRRLRLDDDULLRLRDURRLRLUUUDLLRLRRRLRL

result:

ok Valid Solution (Length = 89).

Test #9:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

output:

LDLLRRRDLRLDULLLDLRDLLRRLLLRDULDDUUDDDUUUDLRLLRRDUDDUULLRRLLLRDLRLDLLRRRDLRLDULLLDRDLLLUDLRLDRRRLLDLRLDRLLLRRLLUUDDUDRRLLRLDUUUDDDUUDDLUDRLLLRRLLDRLDLLLUDLRLDRRRLLDL

result:

ok Valid Solution (Length = 165).

Test #10:

score: 0

Accepted

time: 0ms

memory: 3676kb

input:

output:

LRUUDDDLLRRUDLLRULLLRUULLRRULLRUDLLLRUUDDLLLDDUURLLLDURLLURRLLUURLLLURLLDURRLLDDDUURL

result:

ok Valid Solution (Length = 85).

Test #11:

score: 0

Accepted

time: 0ms

memory: 3696kb

input:

output:

LLRRLLRRRLLRRRUUUDDDRLRRLLRRLLLRRLLLUULRLLRRLLRRRLLRRRURLRRLLRRLLLRRLLLLRLLRRLLRRRLLRRRUDRLRRLLRRLLLRRLLLUUDDUUUDDDLRLLRRLLRRRLLRRRURLRRLLRRLLLLLRRLLRRRLLRRRUUUDDDRLRRLLRRLLLRRLLLUULRLLRRLRRLLRLUULLLRRLLLRRLLRRLRDDDUUURRRLLRRRLLRRLLLLLRRLLRRLRURRRLLRRRLLRRLLRLDDDUUUDDUULLLRRLLLRRLLRRLRDURRRLLRRRLLRR...

result:

ok Valid Solution (Length = 375).

Test #12:

score: 0

Accepted

time: 0ms

memory: 3660kb

input:

output:

UUDDLLLLUUUDDDUUUUDDDDLRLLRRLLLRRRLLLLRRRRUUUUUDDDDLLUUUUUDDDDLLUUUULRLLRRLLLRRRLLLLRRRRLLUDULLUDUUDDLRLLRRLLLRRRLLLLRRRRUUUDDLLLLUUUDDDUUUUDDDDLRLLRRLLLRRRLLLLRRRRUUUUUDDDDLLUUUUUDDDDLLUUULUUULLDDDDUUUUULLDDDDUUUUURRRRLLLLRRRLLLRRLLRLDDDDUUUUDDDUUULLLLDDUUURRRRLLLLRRRLLLRRLLRLDDUUDULLUDULLRRRRLLLLR...

result:

ok Valid Solution (Length = 379).

Test #13:

score: 0

Accepted

time: 0ms

memory: 3692kb

input:

output:

RRLLLLDDRRRRDDULLLLDUDUURRRRLLLLDDRRRRRRRRRDDLLLLRRRRUUDUDLLLLUDDRRRRDDLLLLRR

result:

ok Valid Solution (Length = 77).

Test #14:

score: 0

Accepted

time: 1ms

memory: 3584kb

input:

output:

-1

result:

ok No Solution.

Test #15:

score: 0

Accepted

time: 0ms

memory: 3700kb

input:

output:

LLLLDULRLLRRDDUULLRRRLLRRRDUUDLLLLDDUUUUDLRLLRRUDLLUDDLRLLRRLLRRRLLRRRLLLLLLLLLRRRLLRRRLLRRLLRLDDULLDURRLLRLDUUUUDDLLLLDUUDRRRLLRRRLLUUDDRRLLRLUDLLLL

result:

ok Valid Solution (Length = 149).

Test #16:

score: 0

Accepted

time: 0ms

memory: 3620kb

input:

output:

RRRRLRRLLDDRRRLRRLLRRRLLLRRRRLLLLUUDDRRUURRRLLLRRRRLRRLLDDRDRDDLLRRLRRRRLLLRRRUURRDDUULLLLRRRRLLLRRRLLRRLRRRDDLLRRLRRRR

result:

ok Valid Solution (Length = 119).

Test #17:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

output:

-1

result:

ok No Solution.

Test #18:

score: 0

Accepted

time: 0ms

memory: 3660kb

input:

output:

LLLRRRLLLRRRRDRLRLLRLLRLLDLRLLRRLLLRRRLLLRRRRDRLRLLRLLRLLDLRLLRRLLLRRRLLLRRRRRLRLLRLLRLLDULRLLRRLLLRRRLLLRRRRDDUURLRLLRLLRLLDDDUUUDDDDUUUULRRLLDLRLLRRLLLRRRLLLRRRRDDDDUUUURLRLLLLLRRRLLLRRRRDRLRLLRLLRLLDLRLLRRLLLRRRLLLRRRRDRLRLLRLLRLLRLLRLRDRRRRLLLRRRLLLRRLLRLDLLRLLRLLRLRDRRRRLLLRRRLLLLLRLRUUUUDDDDRR...

result:

ok Valid Solution (Length = 461).

Test #19:

score: -100

Wrong Answer

time: 0ms

memory: 3684kb

input:

output:

RRRRDUDUULLLLUUUDDDDUUDUUDUURRRRUDDUULLUDDUULLUDUUDDRRUUUDDDDUURRUUUDDDUUUDDDDLLLLRRRRDUDUULLLLLUUDUDRRRRLLLLDDDDUUUDDDUUURRUUDDDDUUURRDDUUDULLUUDDULLUUDDURRRRUUDUUDUUDDDDUUULLLLUUDUDRRRR

result:

wrong answer End Point Is (2,1), Not (er = 2, ec = 3)