Tempter of the Bone解析（回溯算法）hdu1010 zoj2110

Tempter of the Bone

Problem Description

The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze.

The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.

 

 

Input

The input consists of multiple test cases. The first line of each test case contains three integers N, M, and T (1 < N, M < 7; 0 < T < 50), which denote the sizes of the maze and the time at which the door will open, respectively. The next N lines give the maze layout, with each line containing M characters. A character is one of the following:

'X': a block of wall, which the doggie cannot enter;
'S': the start point of the doggie;
'D': the Door; or
'.': an empty block.

The input is terminated with three 0's. This test case is not to be processed.

 

 

Output

For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.

 

 

Sample Input

  
  

   
   4 4 5
S.X.
..X.
..XD
....
3 4 5
S.X.
..X.
...D
0 0 0
  
  

 题意讲得是：一只狗跑到迷宫吃骨头，结果发生了意外，迷宫要倒塌了，狗在的起点为s，出口在d，而x表示有墙不能通过，.表示能通过，但是，要在规定的时间内狗要跑到出口处，不能长也不能短，还有每个地方只能经过一次，如果狗能逃出就输出YES，否则为NO，以输入0 0 0表结束。

分析：这是典型的回溯法，剪枝比较重要。要剪的地方：1 如果所能经过的总步数少于从起点到出口的步数，排除  2 如果目前狗所在位置到出口所要走的步数与剩下的步数奇偶相异，排除。代码如下：

#include<iostream>
using namespace std;
#include<string.h>
#include<math.h>
int m,n,t;
#define max 15
bool ok;
char a[max][max];
int si,sj,di,dj,sum;
//int xx00;
int d[4][2]={{-1,0},{1,0},{0,-1},{0,1}};//上下左右方向

void dfs(int i,int j,int foot)
{
 int k;
 int ii,jj;
 if(i==di && j==dj && foot==t) //符合要求，跳出
    ok=true;
 if(ok)
  return;

 if(( abs(i-di)+abs(j-dj) )%2!=(t-foot)%2)
  return;

 for(k=0;k<4;k++)
 {
  ii=i+d[k][0]; jj=j+d[k][1];//跳格

  if(ii>=0 && ii<m && jj>=0 && jj<n && a[ii][jj]!='X')
  {
   a[ii][jj]='X';
   //foot++;
   dfs(ii,jj,foot+1);
   a[ii][jj]='.';
  }
 }
// xx00=foot;
}

int main()
{
 int i,j;
 while(scanf("%d%d%d",&m,&n,&t) && (m+n+t))
 {
  getchar();
  sum=0;ok=false;
  for(i=0;i<m;i++)
  {
   for(j=0;j<n;j++)//why j>=n
   {

    scanf("%c",&a[i][j]);

    if(a[i][j]=='S')
    {
     si=i;
     sj=j;
     a[i][j]='X'; 
    }
    else if(a[i][j]=='D')
    { 
     di=i;
     dj=j;
     sum++;
    }
    else if(a[i][j]=='.') sum++;
   }
   getchar();
  }

  if(sum<t)
  {
   printf("NO/n");continue;
  }
  else
   dfs(si,sj,0);
  if(ok)
   printf("YES/n");
  else
   printf("NO/n");
 }
 return 0;
}