hdu 1010

Tempter of the Bone

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 74364    Accepted Submission(s): 20353

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

 

Sample Output

NO YES

 

路径剪枝：如果给出的时间比a*b还要大，说明就算全走一遍也还没到时间。如果在某一时间，剩余的时间比到终点可能的最短路径还短，那么也不对了。

奇偶剪枝：在二维数组里，两个点横纵坐标和都是奇数或者都是偶数，那么必定需要偶数步到达。如果一奇一偶，必须需要奇数步到达。转化可得：两点的横坐标差加两点的纵坐标差如果是奇数，必定奇数步到达，如果是偶数，必定偶数步到达。所以在每一个点里都进行一次判断：如果当前剩余的时间-横纵坐标差的和 = 奇数，那么肯定不符合要求（奇数-奇数=偶数，偶数-偶数=偶数。顾符合条件的点相减必定为偶数）。

#include

#include

#include

using namespace std;

int   flag, a, b, c,   ei, ej, wall, dirx[4] = {1, -1, 0, 0}, diry[4] = {0, 0, 1, -1};

int vis[9][9];

char m[9][9];

void dfs(int i, int j, int t)

{

    int k, temp;

    if(i < 1 || j < 1 || i > a || j > b || flag)

          return;

    if(i == ei && j == ej && t == c)

    {

        if(t == c)

            flag = 1;

        return;

    }

    temp = (c - t) - abs(i-ei) - abs(j-ej);   //重要的剪枝！两个abs的和是可能的最短路径的步数，这个和既可以作为路径剪枝，也可以作为奇偶剪枝，成为判断奇偶数的标准。

    if(temp < 0 || temp&1)return;     //如果剩余时间比走的可能的最短还要少，或者剩余时间-坐标差和为奇数，那么肯定玩完。直接return。

   

    if(vis[i][j] == 1 || m[i][j] == 'X')

        return;

    vis[i][j] = 1;

    dfs(i+1, j, t+1);

    dfs(i-1, j, t+1);

    dfs(i, j+1, t+1);

    dfs(i, j-1, t+1);

    vis[i][j] = 0;

}

int main()

{

    int i, j, x, y;

    while(scanf("%d %d %d", &a, &b, &c), a!=0||b!=0||c!=0)

    {

        flag = 0;

        wall = 0;

        memset(vis, 0, sizeof(vis));

        for(i = 1 ; i <= a ; i++)

        {

            for(j = 1 ; j <= b ; j++)

            {

                cin>>m[i][j];

                if(m[i][j] == 'S')

                {

                    x = i;

                    y = j;

                }

                else if(m[i][j] == 'D')

                {

                    ei = i;

                    ej = j;

                }

                else if(m[i][j] == 'X')

                    wall++;

            }

        }

        if(a*b-wall <= c)

        {

            cout<<"NO"<<endl;

            continue;

        }

        //m[x][y] = 'X';

        dfs(x, y, 0);

        if(flag)

            cout<<"YES"<<endl;

        else

            cout<<"NO"<<endl;

    }

    return 0;

}