Tempter of the Bone（DFS+奇偶剪枝）

最新推荐文章于 2020-02-22 19:04:33 发布

御史大夫

最新推荐文章于 2020-02-22 19:04:33 发布

阅读量2.3k

点赞数

分类专栏： ACM题解

本文链接：https://blog.csdn.net/cs_zlg/article/details/8545497

版权

ACM题解专栏收录该内容

28 篇文章

订阅专栏

本文详细介绍了如何利用深度优先搜索（DFS）结合奇偶剪枝策略来解决名为'Tempter of the Bone'的问题。通过实例解析输入输出格式，并给出样例输入及对应的正确输出，帮助读者理解算法的实施步骤和有效性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Tempter of the Bone

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status

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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

int n, m, t;
int s[2], d[2];  //the position of the start point and the door
char map[8][8];
const int move[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

int CutBranch(int i, int j)
{
    return abs(i - d[0]) + abs(j - d[1]);
}

bool Judge(int i, int j)
{
    return (map[i][j] != 'X' && i >= 0 && i < n && j >= 0 && j < m);
}

bool DFS(int i, int j, int cnt)
{
    int a = CutBranch(i, j);
    if((a & 1) != ((t - cnt) & 1) || a > t - cnt) return 0;
    if(cnt == t)
        return map[i][j] == 'D' ?  1 : 0;
    if(map[i][j] == 'D')
        return cnt == t ? 1 : 0;
    map[i][j] = 'X';
    for(int k = 0; k < 4; k++)
    {
        int ii = i + move[k][0];
        int jj = j + move[k][1];
        if(Judge(ii, jj))
        {
            char tmp = map[ii][jj];
            int res = DFS(ii, jj, cnt + 1);
            if(res) return 1;
            map[ii][jj] = tmp;
        }
    }
    return 0;
}

int main()
{
    int num_X;
    while(scanf("%d %d %d", &n, &m, &t) && n)
    {
        num_X = 0;
        for(int i = 0; i < n; i++)
            scanf("%s", map[i]);
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
            {
                if(map[i][j] == 'X') num_X++;
                if(map[i][j] == 'S')
                    s[0] = i, s[1] = j;
                else if(map[i][j] == 'D')
                    d[0] = i, d[1] = j;
            }
        if(t > n * m - num_X) puts("NO");
        else
        {
            bool res = DFS(s[0], s[1], 0);
            if(res) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}