HDU 1010 Tempter of the Bone DFS剪枝、判断

HDU 1010 Tempter of the Bone DFS剪枝、判断

先上题目描述如下：（源于hdu oj官网）
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

分析、解后感：
1.最后的code较蠢但是ac了fine；
2.本题采用dfs,但是直接无脑容易Time Limit Exceeded,so要进行优化；
–2补充.dfs一般都要用visited和depth；
3.用到图，我用了邻接矩阵所以程序庞大显蠢；
4.优化的点主要有：
(1)事先根据网格的S到D的最短距离判断能否在T内到达，不能then直接输出NO;
(2)再利用奇偶剪枝，从[https://www.cnblogs.com/yinbiao/p/9313239.html]了解到相关知识：（干货，感动！，ac之心）
{
涉及到奇偶剪枝（说一下自己的理解）：
把矩阵看成如下形式：
0 1 0 1 0 1
1 0 1 0 1 0
0 1 0 1 0 1
1 0 1 0 1 0
0 1 0 1 0 1
从为 0 的格子走一步，必然走向为 1 的格子 。
从为 1 的格子走一步，必然走向为 0 的格子 。
即：
从 0 走向 1 必然是奇数步，从 0 走向 0 必然是偶数步。

所以当遇到从 0 走向 0 但是要求时间是奇数的或者 从 1 走向 0 但是要求时间是偶数的，都可以直接判断不可达！
}
(3)再有就是一定要用visited！！刚开始我没用，肯定超时（dfs不规范）
(4)emmm
利用if (judge)
{
return;
}
在递归dfs中合适位置加上可有奇效（避免超时）

from the mentioned above，code如下：

#include<iostream>
using namespace std;
int start; int door;
int n, m, t; int aa, bb, cc, dd;
int depth = 0; int visited[50];
void est(int adjacent_matrix[][49], int now, int& judge)
{
    if (judge)
    {
        return;
    }
   
    if (now == door)
    {
        if (depth == t)
        {
            judge = 1;
            return;
        }
        else
        {
            return;
        }
    }
    if (depth >= t)
    {
        return;
    }
    int xx;
    if (now<0 || now>m * m - 1)
    {
        return;
    }
    for (int i = 0; i < 4; i++)
    {
        switch (i)
        {
        case 0:
            xx = now - m;
            if (xx < 0 || adjacent_matrix[now][xx] == 1||visited[xx]==1)
            {
                continue;
            }
            else
            {
                depth++; visited[xx] = 1;
                est(adjacent_matrix, xx, judge);
                visited[xx] = 0;
                depth--;
                if (judge)
                {
                    return;
                }
            }
            break;
        case 1:
            xx = now - 1;
            if (now % m == 0 || adjacent_matrix[now][xx] == 1 || visited[xx] == 1)
            {
                continue;
            }
            else
            {
                depth++; visited[xx] = 1;
                est(adjacent_matrix, xx, judge);
                visited[xx] = 0;
                depth--;
                if (judge)
                {
                    return;
                }
            }
            break;
        case 2:
            xx = now + m;
            if (xx > m * n - 1 || adjacent_matrix[now][xx] == 1 || visited[xx] == 1)
            {
                continue;
            }
            else
            {
                depth++; visited[xx] = 1;
                est(adjacent_matrix, xx, judge);
                visited[xx] = 0;
                depth--;
                if (judge)
                {
                    return;
                }
            }
            break;
        case 3:
            xx = now + 1;
            if (xx % m == 0 || adjacent_matrix[now][xx] == 1 || visited[xx] == 1)
            {
                continue;
            }
            else
            {
                depth++; visited[xx] = 1;
                est(adjacent_matrix, xx, judge);
                visited[xx] = 0;
                depth--;
                if (judge)
                {
                    return;
                }
            }
            break;
        }
    }

}
int main()
{
    char a[7][7];
    while (cin >> n >> m >> t)
    {
        depth = 0;
        int adjacent_matrix[49][49] = { 0 };
        if (!n)
        {
            break;
        }
        //输入并找到入口出口
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                cin >> a[i][j];
                if (a[i][j] == 'S')
                {
                    start = i * m + j;
                    aa = i; bb = j;
                }
                else if (a[i][j] == 'D')
                {
                    door = i * m + j;
                    cc = i; dd = j;
                }
                else if (a[i][j] == 'X')
                {
                    int pp = i * m + j;
                    if (pp == 0)
                    {
                        adjacent_matrix[i * m + j][i * m + j + m] = adjacent_matrix[i * m + j + m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + 1] = adjacent_matrix[i * m + j + 1][i * m + j] = 1;
                    }
                    else if (pp == m - 1)
                    {
                        adjacent_matrix[i * m + j][i * m + j + m] = adjacent_matrix[i * m + j + m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j - 1] = adjacent_matrix[i * m + j - 1][i * m + j] = 1;
                    }
                    else if (pp == m * n - m)
                    {
                        adjacent_matrix[i * m + j][i * m + j - m] = adjacent_matrix[i * m + j - m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + 1] = adjacent_matrix[i * m + j + 1][i * m + j] = 1;
                    }
                    else if (pp == m * n - 1)
                    {
                        adjacent_matrix[i * m + j][i * m + j - m] = adjacent_matrix[i * m + j - m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j - 1] = adjacent_matrix[i * m + j - 1][i * m + j] = 1;
                    }
                    else if (pp < m * n - 1 && pp > m * n - m)
                    {

                        adjacent_matrix[i * m + j][i * m + j - 1] = adjacent_matrix[i * m + j - 1][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j - m] = adjacent_matrix[i * m + j - m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + 1] = adjacent_matrix[i * m + j + 1][i * m + j] = 1;
                    }
                    else if (pp < m - 1 && pp >0)
                    {

                        adjacent_matrix[i * m + j][i * m + j - 1] = adjacent_matrix[i * m + j - 1][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + m] = adjacent_matrix[i * m + j + m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + 1] = adjacent_matrix[i * m + j + 1][i * m + j] = 1;
                    }
                    else if (pp % m == 0)
                    {

                        adjacent_matrix[i * m + j][i * m + j - m] = adjacent_matrix[i * m + j - m][i * m + j] = 1;

                        adjacent_matrix[i * m + j][i * m + j + m] = adjacent_matrix[i * m + j + m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + 1] = adjacent_matrix[i * m + j + 1][i * m + j] = 1;
                    }
                    else if ((pp + 1) % m == 0)
                    {

                        adjacent_matrix[i * m + j][i * m + j - m] = adjacent_matrix[i * m + j - m][i * m + j] = 1;

                        adjacent_matrix[i * m + j][i * m + j + m] = adjacent_matrix[i * m + j + m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j - 1] = adjacent_matrix[i * m + j - 1][i * m + j] = 1;
                    }
                    else
                    {

                        adjacent_matrix[i * m + j][i * m + j - m] = adjacent_matrix[i * m + j - m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j - 1] = adjacent_matrix[i * m + j - 1][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + m] = adjacent_matrix[i * m + j + m][i * m + j] = 1;
                        adjacent_matrix[i * m + j][i * m + j + 1] = adjacent_matrix[i * m + j + 1][i * m + j] = 1;
                    }
                }
            }
        }
        if (abs(cc - aa) + abs(dd - bb) > t || (aa + bb + cc + dd + t) % 2 == 1)
        {
            cout << "NO" << endl;
            continue;
        }
        memset(visited, 0, sizeof(visited));
        visited[start] = 1;
        int judge = 0;
        est(adjacent_matrix, start, judge);
        if (judge)
        {
            cout << "YES";
        }
        else
        {
            cout << "NO";
        }
        cout << endl;
    }
    return 0;
}