这道题,刷了m次终于AC了。这道题应注意
1.奇偶剪枝
2.其他常见情况剪枝
3.一定注意题干条件,一定是第T秒时到D,不能早于或者晚于T
其它没什么的了。。。。
代码附上。#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
const int row[4] = {-1,1,0,0};
const int col[4] = {0,0,-1,1};
int dfs(int x,int y,const int n,const int m,int t,int T,char chess[][7],const int start_x,const int start_y,const int end_x,const int end_y)//dfs from (x,y)
{
t++;
int dx,dy;
if(t > T) return 0;
if(x == end_x && y == end_y) {
if(t == T) return 1;
else return 0;
}
int temp = T-t-abs(x-end_x)-abs(y-end_y);
if(temp%2 != 0 || temp < 0) return 0;
for(int i = 0;i <= 3; i++){
dx = x+row[i];
dy = y+col[i];
if(dx >= 1 && dx <= n && dy >= 1 && dy <= m && chess[dx][dy] != 'X' && chess[dx][dy] != 'S'){
chess[dx][dy] = 'X';
if(dfs(dx,dy,n,m,t,T,chess,start_x,start_y,end_x,end_y)) return 1;
chess[dx][dy] = '.';
}
}
return 0;
}
int main()
{
char chess[7][7];
int n,m,T,i,j,t;
int start_x,start_y,end_x,end_y;
char ch;
memset(chess,0,sizeof(chess));
scanf("%d%d%d",&n,&m,&T);
while(!(n == 0 && m == 0 && T == 0)){
memset(chess,0,sizeof(chess));
for(i = 1;i <= n; i++){
scanf("%s",&chess[i][1]);
for(j = 1;j <= m; j++){
ch = chess[i][j];
if(ch == 'S'){
start_x = i;
start_y = j;
}
else if(ch == 'D'){
end_x = i;
end_y = j;
}
}
}
if(dfs(start_x,start_y,n,m,-1,T,chess,start_x,start_y,end_x,end_y)) printf("YES\n");
else printf("NO\n");
scanf("%d%d%d",&n,&m,&T);
}
return 0;
}