hdu 1010

剪枝  这道题要注意的就是首先要预处理    abs（x1-x2）+abs(y1-y2)的值和T的值比较  还有就是运动中的剪枝  (dis+t-time)%2!=0||dis>t-time  这一步很重要

# include <stdio.h>
# include <string.h>
# include <math.h>
# include <stdlib.h>
int n,m,t,bx,by,ex,ey,flag=0;
char map[10][10];
int visit[10][10];
int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};
void dfs(int x ,int y,int time)
{
	int i;
	if(flag==1){return ;}
	if(time==t)
		if(x==ex&&y==ey)
		{flag=1;return;}
	if(t<=time)return ;
	int dis;
	dis =abs(x-ex)+abs(y-ey);
	if((dis+t-time)%2!=0||dis>t-time)
		return ;
	for(i=0;i<4;i++)
	{
		int nx=x+dx[i];  
      int ny=y+dy[i];  
        
      if(nx>=0&&nx<n&&ny>=0&&ny<m&&visit[nx][ny]!=1&&map[nx][ny]!='X')  
      { 
        visit[nx][ny]=1;     
        dfs(nx,ny,time+1);   
        visit[nx][ny]=0;   
		}
	}
	return;
}
int main()
{
	int i,j,temp,dis,ji;
	while(scanf("%d %d %d",&n,&m,&t)!=EOF)
	{
		ji=1;
		for(i=0;i<10;i++)
			for(j=0;j<10;j++)
				visit[i][j]=0;
		if(n==0&&m==0&&t==0)
		   break;
		for(i=0;i<n;i++)
		{
			scanf("%s",map[i]);
			for(j=0;j<m;j++)
			{
				if(map[i][j]=='S'){bx=i;by=j;}
				if(map[i][j]=='D'){ex=i;ey=j;}
				if(map[i][j]=='.'){ji++;}
			}
		}
		if(ji<t){printf("NO\n");continue;}
		int dis=abs(bx-ex)+abs(by-ey);
		if((dis+t)%2!=0){printf("NO\n");continue;}
		flag=0;
		visit[bx][by]=1;
		dfs(bx,by,0);
		if(flag==1)
			printf("YES\n");
		else 
			printf("NO\n");
	}
	return 0;
}