QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #395472 | #7751. Palindrome Path | Xun_xiaoyao | WA | 0ms | 3812kb | C++14 | 2.2kb | 2024-04-21 15:07:23 | 2024-04-21 15:07:23 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int Qread()
{
int x=0;char ch=getchar();
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
return x;
}
int get_ch()
{
char ch=getchar();
while(ch!='0'&&ch!='1') ch=getchar();
return ch=='1';
}
bool fin,vis[40][40],mp[40][40];
int n,m,stx,sty,enx,eny;
char stk[810010];int top;
void dfs(int x,int y)
{
vis[x][y]=true;
if(x>1&&mp[x-1][y]&&!vis[x-1][y])
{
stk[++top]='U';
dfs(x-1,y);
stk[++top]='D';
}
if(x<n&&mp[x+1][y]&&!vis[x+1][y])
{
stk[++top]='D';
dfs(x+1,y);
stk[++top]='U';
}
if(y>1&&mp[x][y-1]&&!vis[x][y-1])
{
stk[++top]='L';
dfs(x,y-1);
stk[++top]='R';
}
if(y<m&&mp[x][y+1]&&!vis[x][y+1])
{
stk[++top]='R';
dfs(x,y+1);
stk[++top]='L';
}
}
void tkop(int &x,int &y,char op)
{
if(op=='U'&&x>1&&mp[x-1][y]) x--;
if(op=='D'&&x<n&&mp[x+1][y]) x++;
if(op=='L'&&y>1&&mp[x][y-1]) y--;
if(op=='R'&&y<m&&mp[x][y+1]) y++;
}
bool vid[40][40][40][40];
void calc(int stx,int sty,int enx,int eny)
{
if(vid[stx][sty][enx][eny]) return;
vid[stx][sty][enx][eny]=true;
if(stx==enx&&sty==eny)
{
for(int i=1;i<=top;i++) putchar(stk[i]);
reverse(stk+1,stk+top+1);
for(int i=1;i<=top;i++) putchar(stk[i]);
exit(0);
}
int x_,y_;
top++;
tkop(x_=stx,y_=sty,stk[top]='U');
if(enx==1||!mp[enx-1][eny]) calc(x_,y_,enx,eny);
if(enx<n&&mp[enx+1][eny]) calc(x_,y_,enx+1,eny);
tkop(x_=stx,y_=sty,stk[top]='D');
if(enx==n||!mp[enx+1][eny]) calc(x_,y_,enx,eny);
if(enx>1&&mp[enx-1][eny]) calc(x_,y_,enx-1,eny);
tkop(x_=stx,y_=sty,stk[top]='L');
if(enx==1||!mp[enx][eny-1]) calc(x_,y_,enx,eny);
if(eny<m&&mp[enx][eny+1]) calc(x_,y_,enx,eny+1);
tkop(x_=stx,y_=sty,stk[top]='R');
if(enx==m||!mp[enx][eny+1]) calc(x_,y_,enx,eny);
if(enx>1&&mp[enx][eny-1]) calc(x_,y_,enx,eny-1);
top--;
}
int main()
{
n=Qread(),m=Qread();
for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
mp[i][j]=get_ch();
stx=Qread(),sty=Qread(),enx=Qread(),eny=Qread();
dfs(enx,eny);
for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
if(mp[i][j]&&!vis[i][j])
return printf("-1\n"),0;
reverse(stk+1,stk+top+1);
for(int i=1;i<=top;i++)
tkop(stx,sty,stk[i]);
calc(stx,sty,enx,eny);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3728kb
input:
2 2 11 11 1 1 2 2
output:
DRUDLUDDURRUDDULDURD
result:
ok Valid Solution (Length = 20).
Test #2:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
2 2 10 01 1 1 2 2
output:
-1
result:
ok No Solution.
Test #3:
score: 0
Accepted
time: 0ms
memory: 3512kb
input:
1 1 1 1 1 1 1
output:
result:
ok Valid Solution (Length = 0).
Test #4:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
5 4 1111 1111 1111 1111 1111 4 2 4 2
output:
DDDRUUUULLDDDDLUUUUDDDDRUUUURRDDDDLUUUUDDDDDDULUDDDDDUUULDDDDDURUDDDDDUUURDDDDDURRUDDDDDRUUUDDDDDURUDDDDDLUUUDDDDDULUDDDDDDUUUULDDDDRRUUUURDDDDUUUULDDDDLLUUUURDDD
result:
ok Valid Solution (Length = 162).
Test #5:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
5 5 11111 10101 11111 10101 11111 1 4 5 5
output:
DDDDRRUULRUULRRRDDLRDDLRUUUULLDDDDLLUUUUDDDDDDDUURURDDDDDUUURULDDDDLUUUDDDURUURUURDDDDLUUUDDDURUUUURDDDDRUUUURUDDDUUULDDDDRUURUURUDDDUUULDDDDLURUUUDDDDDRURUUDDDDDDDUUUULLDDDDLLUUUURLDDRLDDRRRLUURLUURRDDDD
result:
ok Valid Solution (Length = 204).
Test #6:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
5 3 111 100 111 001 111 4 3 3 2
output:
LUURRLLDDRRDDLLRRUULLUURRLLDDRRDDLLRRUUL
result:
ok Valid Solution (Length = 40).
Test #7:
score: 0
Accepted
time: 0ms
memory: 3524kb
input:
5 4 1001 1101 1111 0011 0010 2 2 1 1
output:
UULLULDDDUUURUDDRDURDDUUUDDLUDDULDDUUUDDRUDRDDURUUUDDDLULLUU
result:
ok Valid Solution (Length = 60).
Test #8:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
5 3 101 111 100 111 100 4 1 2 2
output:
LDURRUULLRRUDDDDULLDDUUUUUDDRUURUUUDDDDDDDDUUURUURDDUUUUUDDLLUDDDDURRLLUURRUDL
result:
ok Valid Solution (Length = 78).
Test #9:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
5 5 01110 10110 11110 11011 11100 2 4 5 1
output:
DDLLDDLUUULRDDDRRLUURUULRDDRDUUUDDDDDULUDLDDDDULLUDDDDLDULUDDDDDUUUDRDDRLUURUULRRDDDRLUUULDDLLDD
result:
ok Valid Solution (Length = 96).
Test #10:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
5 3 011 111 110 111 011 3 1 2 1
output:
UULULDURDDDDLUDRUUURDDUUUDDLUDLUDDULDULDDUUUDDRUUURDULDDDDRUDLULUU
result:
ok Valid Solution (Length = 66).
Test #11:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
4 5 11111 11111 11111 11111 3 2 1 3
output:
UUULDDDLUUUDDDRUUURRDDDRUUUDDDLUUULDDDUUUUUUDDDLUUULDDDUUURDDDRRUUURDDDUUULDDDLUUU
result:
ok Valid Solution (Length = 82).
Test #12:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
5 5 11111 10101 11111 10101 11111 2 5 1 1
output:
UUUULLDDRLDDLLUURLUURLDDDDRRRLUUUURRDDDDUUUUUUUUDDDDDDDUULULDDDDDUUULULDDDDLUUUUDDDDDDDUURULUULDDDDDDDUURURDDDDDUUURULDDDDLUUUDDDURUURUURDDDDLUUUDDDURUUUURDDDDRUUUURUDDDUUULDDDDRUURUURUDDDUUULDDDDLURUUUDDDDDRURUUDDDDDDDLUULURUUDDDDDDDUUUULDDDDLULUUUDDDDDLULUUDDDDDDDUUUUUUUUDDDDRRUUUULRRRDDDDLRUULRUU...
result:
ok Valid Solution (Length = 314).
Test #13:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
4 5 11111 10000 11111 00001 1 3 4 5
output:
DRRRRDDLLLLRRRRUULLLLUDDDUURURDRURDRRRRDDLUULDDLUULDDDDLUULDDLUULDDRRRRDRURDRURUUDDDULLLLUURRRRLLLLDDRRRRD
result:
ok Valid Solution (Length = 106).
Test #14:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
3 5 10100 00010 00111 1 3 1 1
output:
-1
result:
ok No Solution.
Test #15:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
4 5 10001 11111 11100 11111 4 5 3 1
output:
DLUULLLRRDDLLDURRUURRLDDRDUUUDDDDUULUUDDDLUULDDLUURDDRRRRDDRUULDDLUULDDDUULUUDDDDUUUDRDDLRRUURRUDLLDDRRLLLUULD
result:
ok Valid Solution (Length = 110).
Test #16:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
3 5 11111 10100 11111 1 2 3 5
output:
RRDDLLRRRRUULRDDLLUULLDDRRUURRRRDDLUULDDRDDLUUUULDDRDDLUULDDRRRRUURRDDLLUULLDDRLUURRRRLLDDRR
result:
ok Valid Solution (Length = 92).
Test #17:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
4 5 01110 10101 11011 10111 1 3 2 3
output:
-1
result:
ok No Solution.
Test #18:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
5 5 11111 11111 11111 11111 11111 1 3 5 2
output:
DDDDLUUUULDDDDLUUUUDDDDRUUUURDDDDRRUUUUDDDDLUUUUDDDDDDULLUDDDDDDUUUULDDDDUUUURRDDDDRUUUURDDDDUUUULDDDDLUUUULDDDD
result:
ok Valid Solution (Length = 112).
Test #19:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
5 5 11111 10101 11111 10101 11111 5 1 2 3
output:
DRRUUUULLDDLLUURLDDDDRLUURRRLUURRDDDDLLUUUULLDDDDRRUULRRRUULRDDDDLRUULLDDLLUUUURRD
result:
ok Valid Solution (Length = 82).
Test #20:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
5 5 11111 10000 11111 00001 11111 4 5 5 3
output:
LLDDRRRRDDLLLLRRRRUULLLLUURRRRLLLLDDDDUUURURDDRUURDDRRRRDDLUULDDLUULDDDDLUULDDLUULDDRRRRDDRUURDDRURUUUDDDDLLLLRRRRUULLLLUURRRRLLLLDDRRRRDDLL
result:
ok Valid Solution (Length = 140).
Test #21:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
5 5 01010 10101 10101 11001 10011 4 1 5 4
output:
-1
result:
ok No Solution.
Test #22:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
5 5 10101 11111 10101 11111 11111 3 1 2 4
output:
RUUULDLUDDDDUUURURRDRUDDDLRDUUULULDDDDULDLUUUDDDDDURUDDDDURUUDDDDDURUDDDDURUUDDDDDDUURUDDDDURUDDDDDUURUDDDDURUDDDDDUUULDLUDDDDLULUUUDRLDDDURDRRURUUUDDDDULDLUUUR
result:
ok Valid Solution (Length = 160).
Test #23:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
5 5 00001 11111 01110 01111 01111 1 5 5 2
output:
DDDLUUULDLUDRDDLDURUUURDDDRRLUUUDDDDDULUDDDDDUUUUUUDDLUUDDDDDDUULDDUUUUUUDDDDDULUDDDDDUUULRRDDDRUUURUDLDDRDULDLUUULDDD
result:
ok Valid Solution (Length = 118).
Test #24:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
5 5 01011 10111 11011 10101 01110 4 1 2 3
output:
-1
result:
ok No Solution.
Test #25:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
10 8 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 7 7 3 6
output:
DDRUUUUUUUUULDDDDDDLDDDLUUUUUUUUURDDDDDUUUUULDDDDDDDDDRUUURUUUUUURRDDDDDDDDDRUUUUUUUUURDDDDDDDDDRUUUUUUUUUDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUUDDDDDDDDDDDULUDDDDDUUULDDDDDURUDDDDDUUURDDDDDURUDDDDDUUURDDDDDURUDDDDDUUURDDDDDURRUDDDDDRUUUDDDDDURUDDDDDRUUUDDDDDURUDDDDDRUUUDDDDDURUD...
result:
ok Valid Solution (Length = 492).
Test #26:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
10 6 111111 101010 111111 101010 111111 101010 111111 101010 111111 101010 1 6 2 3
output:
DRRUUUUUUUULLUDDDRLDDRLDDLLLRUULRRLUULRRLUULRRLUDDDDDDDDDLRRLUURRRLUUUUUURRUDDDDDDDDDLLUUUUUUUUULDDDDDDDDDDDDDDDDDDLUUUUUUUUULLDDDDDDDDDURRUUUUUULRRRUULRRLDDDDDDDDDULRRLUULRRLUULRRLUURLLLDDLRDDLRDDDULLUUUUUUUURRD
result:
ok Valid Solution (Length = 212).
Test #27:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
10 10 1111111111 1000000000 1111111111 0000000001 1111111111 1000000000 1111111111 0000000001 1111111111 1000000000 5 5 5 2
output:
LLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDDDUUURURDDRUURDDRUURDDRUURDDRUUUURDDRUURDDRUURDDRUURDDRURUUUDDDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLL
result:
ok Valid Solution (Length = 298).
Test #28:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
10 10 1010110101 0000011010 1001001001 0011111000 1000111100 1011101001 1100110011 0110001011 0011111000 0101011101 7 5 4 3
output:
-1
result:
ok No Solution.
Test #29:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
10 6 100100 111111 100001 111111 101111 111111 101010 111111 111100 111111 6 5 7 3
output:
DDDRRDDLLLLLUUUURUULRRUULLRRRDDRUURDDDDLRDUUUUULDDLUULDDLDDDDRUUDDLUULDDDDRRDURRRDUUULLUUUUUUDDDDDDULDDDUULUUUDDDDDULUUDDDDDURDLULUUURUULRRRRDDDDRDULURDDDUUURUUUDDDDDDUUURUDDDDDDULUDDDDDDUUUUURRDDDUURUUUUDDDDDDUULUDDDDDDURUDDDDUUUUUUDDLUDLDDDDDDUUUUUUUUDDRUDLUULRDDDDDDRUURURDRDDLLDDRDRURUURDDDDDDRLU...
result:
ok Valid Solution (Length = 560).
Test #30:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
10 8 11111110 11110111 01111111 11111101 11011101 11111111 11111011 11011101 11001111 11111110 7 1 2 1
output:
DLUUUUUUUUULLLDDDDDDDRDDLLUUUUULULUURURDDUULDLDDDDDDDRUDDULUUUUURDRDDDDDRRRUUULUUURDULUDDDDRDDDLUULUUUUUUURRRRDDDDDDUUUUUULDDDDDDDDDRUDDULUUUUUUDDDDDLDDDDDUUUUUUUUDDLDDDDUUUUUUUUDDDLDUUUUDDLDDDDDDDDUUUUUUUUUUDLLDUUUUUUUUUUDDDDDDDDLDDUUUUDLDDDUUUUUUUUDDDDLDDUUUUUUUUDDDDDLDDDDDUUUUUULUDDURDDDDDDDDDLUU...
result:
ok Valid Solution (Length = 420).
Test #31:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
10 10 1111011101 1110111110 1111011111 1011101111 0101010111 1110111111 0111010111 1011111011 0111010101 1011111110 2 6 7 4
output:
-1
result:
ok No Solution.
Test #32:
score: 0
Accepted
time: 0ms
memory: 3752kb
input:
8 10 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 8 10 6 10
output:
DDDDDRUUUUUUULDURRDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUURDDDDDDDRUUUUUUUDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULDDDDDDDLUUUUUUULDDDDDDDLUUUUUUUDDDDDDDDDURUDDDDDUUURDDDDDURUDDDDDUUURDDDDDURUDDDDDUUURDDDDDURUDDDDDUUURDDDDDURRUDDDDDRUUUDDDDDURUDDDDDRUUUDDDDDURUDDDDDRUUUDDDDDURUDDDDDRUU...
result:
ok Valid Solution (Length = 478).
Test #33:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
10 10 1111111111 1010101010 1111111111 1010101010 1111111111 1010101010 1111111111 1010101010 1111111111 1010101010 3 5 9 1
output:
UDDDDDDDDDLLUURLUURLUURLUULLUDDDRLDDRLDDRLDDLLUURLUURLUURLUULLLRUDDDLRRLDDLRRLDDLRRLDDLRRLUUUUUUUURRRLUDDDDDDDDDRRRLUUUUUUUURRRLUDDDDDDDDDRRUUUUUUUUUDDDDDDDDDDDULULDDDULULDDLULUDDDLULUDDDDDDDDDDDUUUUUUUUURRDDDDDDDDDULRRRUUUUUUUULRRRDDDDDDDDDULRRRUUUUUUUULRRLDDLRRLDDLRRLDDLRRLDDDURLLLUULRUULRUULRUULL...
result:
ok Valid Solution (Length = 344).
Test #34:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
10 10 1111111111 1000000000 1111111111 0000000001 1111111111 1000000000 1111111111 0000000001 1111111111 1000000000 5 4 7 2
output:
LLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUUUUDDDRURDDRUURDDRUURDDRUURDDRRDDRUURDDRUURDDRUURDDRURDDDUUUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLL
result:
ok Valid Solution (Length = 294).
Test #35:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
9 10 1111001000 1110010111 0001001000 0101000101 1101000001 0111100110 0010010000 0001001000 1011001101 2 8 5 2
output:
-1
result:
ok No Solution.
Test #36:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
5 10 1001011101 1111111111 1000011001 1111111111 1101110010 4 3 4 7
output:
DDDLULLUURRLUDLDDDURRDRRUUUURDRRRURDDDLLLLRDURRRDUUUULDLLUDLULDDDDLUUUDDDDDDURUDDDDUULDDUUUUUDDLUULUUDDDDDDURUDDDDUURUURDDDURUDDDDUURUUDDDDDURUDRDDDLUUUUUUDDDRRDDULULUUULUUDDDUULUUURUUDDDDDUURUURDDDURUUDDDDDUULUUDDDDDDUULUUDDDDDUURUDDDRUURUUDDDDDUURUUULUUDDDUULUUULULUDDRRDDDUUUUUULDDDRDURUDDDDDUURUU...
result:
ok Valid Solution (Length = 430).
Test #37:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
7 10 1111111001 1111101110 1111011111 1101011101 1111011111 1111001011 1111111011 7 10 7 2
output:
-1
result:
ok No Solution.
Test #38:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
9 10 0101011101 1111111111 0101111111 1111111111 1111110101 1011111111 1101111101 1111111011 1101011111 3 7 7 10
output:
DDDDDRUURDDDRUUURDDRUUUUUULDDLULDLRDUURUULLDLUDRURRRLDDDRDUUURRUDDDDDDDRRRLUUULUDDURRUUUULDLRDUURDDDDDULDDDDULLDUUUUUUULDDDDDDLDUUULDDDLUUULDDLDUUUUUUUUDDDDURUDDDDDDDURUDRDDDUURDDDDURUUUDDDDLUUUUUUUUUDDDDDDDDRUUURDDDUULUUUULDDDDUUULUDDDDDDDDDUUURUDDDDUURUUDDDRUUUUUUUDDDDDDRURDDDLLDDDRURDDDDDDUUUUUUU...
result:
ok Valid Solution (Length = 560).
Test #39:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
10 10 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 1111111111 9 5 3 2
output:
DDRUUUUUUUUULDDDDDDLDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUULDDDDDDDDDLUUUUUUUUUDDDDDDDDDRUUUUUUUUURDDDDDDDDDRUUUUUUUUURDDDDDDDDDRUUUUUUUUURRDDDDDUUUUULDDDDDDDDDRUUURUUUUUURDDDDDDDDDLUUUUUUUUUDDDDDDDDDDDULUDDDDDUUULDDDDDULUDDDDDUUULDDDDDULUDDDDDUUULDDDDDULUDDDDDUUULDDDDDURUDDDDDUUURDDDD...
result:
ok Valid Solution (Length = 708).
Test #40:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
10 10 1111111111 1010101010 1111111111 1010101010 1111111111 1010101010 1111111111 1010101010 1111111111 1010101010 2 1 1 3
output:
UUUUUUUULLUDDDRLDDRLDDRLDDLLUURLUURLUURLUULLLRUDDDLRRLDDLRRLDDLRRLDDLRRLUUUUUUUURRRLUDDDDDDDDDRRRLUUUUUUUURRRRUDDDLRDDLRDDLRDDLRUUUUUUUULLUDDDDDDDDDUUUUUUUUUUUUUUUUUUDDDDDDDDDDDULUUUUUUUULUDDDDDDDDDDDULUUUUUUUULUDDDDDDDDDDDULUUUUUUUULUDDDDDDDDDDDULUUUUUUUURRDDDDDDDDDRULDDDDDDDDDLUUUUUUUUUUUUUUUDDDDD...
result:
ok Valid Solution (Length = 1000).
Test #41:
score: 0
Accepted
time: 0ms
memory: 3776kb
input:
10 10 1111111111 1000000000 1111111111 0000000001 1111111111 1000000000 1111111111 0000000001 1111111111 1000000000 7 4 3 5
output:
LLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUUUUDDDRURDDRUURDDRUURDDRUURDDRUUDDDDURURDDLLUURRUURDDRUURDDLLLLDDRRRRUURDDRUURDDLLLLLLUURRRRRRUURDDRUURDDLLLLLLLLDDRRRRRRRRUURDDRDDUUUULDDLUULDDLUULDDLUULDDLUULDULULDDLUULDDLUULDDLUULRRR...
result:
ok Valid Solution (Length = 778).
Test #42:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
10 10 1110000101 1100110001 1011011001 0000000111 0010010111 0100111011 1110010011 1100111111 0110001110 0100000101 9 9 6 10
output:
-1
result:
ok No Solution.
Test #43:
score: -100
Wrong Answer
time: 0ms
memory: 3656kb
input:
10 10 1110111011 1111111111 1110110000 1111111111 1010011100 1111111111 1111001110 1111111111 1001010011 1111111111 6 9 2 9
output:
RRDRUUUUURRUUUULLDDLDDDDLLLRRUUUULUULDDUURRRLLDDDDLRUURDDDDRUUUURRLUURRRRRDDDDDDDDDLUUULUUUURDDUULDDDDDDLLUURLDDDURRDUUURDDDRUUUUUUUUULLLDDDDLLDDDDDLULLDLUDRUDDUUULDDDDDUUUUUUUUUUDDDDRDDDDDDUUUUUUUUUUDDDRUUURDDDDDDDDUUUUUUULUDDDDUULUUDDDDDDDDDDUUUURUDDLDDRDRURUUUUDDDDDDULUUUDDDDDDULUDDDDDUUULUUDDDDD...
result:
wrong answer (1,9) Not Visited