Tempter of the Bone

                                               Tempter of the Bone

                                       Time Limit: 1000ms                                            Memory Limit: 32768KB

                                                        64-bit integer IO format:      Java class name:

 

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

Sample Output

NO
YES
 

题意：
    ”S“为起点，”D“为终点，”X“为塌陷的地板。
    每走一步为1秒，只要走到下一块地板，原来的地板便立即塌陷，判断从起点到终点是否可以刚好t秒。

思路分析：
    直接用深搜会超时，所以要进行简单的剪枝，这里就需要了解奇偶剪枝。
     
                                                    奇偶剪枝

s
|
|
|
+	—	—	—	e

            设所在位置s (sx,sy) 与 目标位置 e(ex,ey)

            易知最短步数step=abs(ex-sx)+abs(ey-sy)

            故 abs(ex-sx)+abs(ey-sy)的奇偶性就确定了最短步数step的奇偶性

            绕过一个有障碍的格子，需要多走两步，如果经过t步刚好到终点，则必定有t-step=偶数；

            因此 只有t-abs(ex-sx)-abs(ey-sy)=偶数（也可以写成t+ex+sx+ey+sy=偶数）， 才能从起点刚好经过t步到达终点。

 

源代码：

#include <cstdio>
#include<iostream>
using namespace std;
const int MAX=10;
int n,m,t;
char a[MAX][MAX];
int d[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
int startx,starty,endx,endy,flag;
void dfs(int dx,int dy,int k)
{
    int i;
    if(flag)return;
    if(a[dx][dy]=='X') return;
    if(dx==endx&&dy==endy&&k==t)
    {
        flag=1;
        return;
    }
    if(dx<1||dx>n||dy<1||dy>m||k>t) return;
    for(i=0;i<4;i++)
    {
        a[dx][dy]='X';
        dfs(dx+d[i][0],dy+d[i][1],k+1);  //这个地方必须用k+1，不然当前一个不达到条件而返回时，k却已经加1
        a[dx][dy]='.';
        if(flag)return;
    }
}
int main()
{

    while(scanf("%d%d%d",&n,&m,&t)&&n&&m&&t)
    {
        flag=0;
        int s=0;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
            {
               cin>>a[i][j];      //如果这里用scanf的话，会吃掉每一行的换行符，
                if(a[i][j]=='S')
                {
                    startx=i;
                    starty=j;
                    continue;
                }
                if(a[i][j]=='D')
                {
                    endx=i;
                    endy=j;
                    continue;
                }
                if(a[i][j]=='X')
                    s++;
        }
        if((t+startx+starty+endx+endy)%2==1)    //奇偶剪枝
        {  cout<<"NO"<<endl; continue;}
        if((m*n-s)<t)
        {  cout<<"NO"<<endl; continue;}
        dfs(startx,starty,0);
        if(flag)
          cout<<"YES"<<endl;
        else
           cout<<"NO"<<endl;
    }
    return 0;
}