QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #191758 | #7516. Robot Experiment | ucup-team266# | AC ✓ | 1ms | 3952kb | C++14 | 770b | 2023-09-30 10:50:42 | 2023-11-04 11:39:21 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
bool vi[45][45],vi2[45][45],an[45][45];
int n;
int dx[4]={-1,1,0,0},dy[4]={0,0,-1,1};
char C[4]={'L','R','D','U'};
char c[25];
void dfs(int x,int y,int z){
if(z==n){an[x][y]=1;return;}
int e=-1;
for(int i=0;i<4;i++)if(C[i]==c[z]){e=i;break;}
int ax=x+dx[e],ay=y+dy[e];
if(vi[ax][ay])dfs(x,y,z+1);
else if(vi2[ax][ay])dfs(ax,ay,z+1);
else{
vi[ax][ay]=1,dfs(x,y,z+1),vi[ax][ay]=0;
vi2[ax][ay]=1,dfs(ax,ay,z+1),vi2[ax][ay]=0;
}
}
int main(){
scanf("%d%s",&n,c);
vi2[22][22]=1,dfs(22,22,0);
int ans=0;
for(int i=0;i<45;i++)for(int j=0;j<45;j++)if(an[i][j])
ans++;
printf("%d\n",ans);
for(int i=0;i<45;i++)for(int j=0;j<45;j++)if(an[i][j])
printf("%d %d\n",i-22,j-22);
return 0;
}
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3756kb
input:
2 RU
output:
4 0 0 0 1 1 0 1 1
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3892kb
input:
20 LLLRLRLRLLLRLLRLRLLR
output:
8 -6 0 -5 0 -4 0 -3 0 -2 0 -1 0 0 0 1 0
result:
ok 9 lines
Test #4:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
20 UUUUUUUUUUUUUUUUUUUU
output:
21 0 0 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 11 0 12 0 13 0 14 0 15 0 16 0 17 0 18 0 19 0 20
result:
ok 22 lines
Test #6:
score: 0
Accepted
time: 0ms
memory: 3740kb
input:
20 LRUDDULRUDRLLRDURLUD
output:
22 -2 0 -2 1 -1 -2 -1 -1 -1 0 -1 1 -1 2 0 -2 0 -1 0 0 0 1 0 2 1 -2 1 -1 1 0 1 1 1 2 2 -2 2 -1 2 0 2 1 2 2
result:
ok 23 lines
Test #7:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
20 UUDUDUUDUDUDUDUDLLRL
output:
12 -2 -1 -2 0 -2 1 -2 2 -1 -1 -1 0 -1 1 -1 2 0 -1 0 0 0 1 0 2
result:
ok 13 lines
Test #8:
score: 0
Accepted
time: 0ms
memory: 3944kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
20 RUDLUULDRURLDURLDURR
output:
29 -3 3 -3 4 -2 2 -2 3 -2 4 -1 1 -1 2 -1 3 -1 4 0 -1 0 0 0 1 0 2 0 3 0 4 1 -1 1 0 1 1 1 2 1 3 2 -1 2 0 2 1 2 2 2 3 3 -1 3 0 3 1 3 2
result:
ok 30 lines
Test #10:
score: 0
Accepted
time: 1ms
memory: 3952kb
input:
20 DLDLDLDLLLDLLDLDLDLR
output:
108 -10 -8 -10 -7 -10 -6 -10 -5 -10 -4 -10 -3 -10 -2 -10 -1 -10 0 -9 -8 -9 -7 -9 -6 -9 -5 -9 -4 -9 -3 -9 -2 -9 -1 -9 0 -8 -8 -8 -7 -8 -6 -8 -5 -8 -4 -8 -3 -8 -2 -8 -1 -8 0 -7 -8 -7 -7 -7 -6 -7 -5 -7 -4 -7 -3 -7 -2 -7 -1 -7 0 -6 -8 -6 -7 -6 -6 -6 -5 -6 -4 -6 -3 -6 -2 -6 -1 -6 0 -5 -8 -5 -7 -5 -6 -5 -...
result:
ok 109 lines
Extra Test:
score: 0
Extra Test Passed