HDU 1010 - Tempter of the Bone（深搜+奇偶剪枝）

最新推荐文章于 2021-01-21 16:48:43 发布

ds_surk

最新推荐文章于 2021-01-21 16:48:43 发布

阅读量242

点赞数 1

分类专栏： ACM解题报告文章标签：搜索杭电剪枝奇偶剪枝

本文链接：https://blog.csdn.net/hunt_er/article/details/78247674

版权

ACM解题报告专栏收录该内容

37 篇文章 1 订阅

订阅专栏

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1010

题目：

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

Sample Output

NO YES

题目描述：

一个简单的深搜加上奇偶剪枝。

代码：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h> 
#include<ctype.h> 
#include<algorithm>
using namespace std;
char d[10][10];
int a,b,c;
int n[4][2]={0,1,
             1,0,
             0,-1,
             -1,0};
int bo[10][10];
int dd;
int ee,rr;
void dfs(int x,int y,int w) 
{
    int i;
    int tx,ty;
    if(w > c)
        return ;
    if(d[x][y] == 'D' && w == c){
        dd = 1;
        return ;
    }
    int ww = c - w + abs(ee - x) + abs(rr - y) ;
    if(ww % 2)
        return ;
    for(i = 0;i < 4;i ++){
         tx = x + n[i][0];
         ty = y + n[i][1];
         if(tx < 0 || tx >= a || ty < 0 || ty >= b)
             continue ;
         if(d[tx][ty] != 'X' && bo[tx][ty] == 0){
             bo[tx][ty] = 1;
             dfs(tx,ty,w + 1);
            bo[tx][ty] = 0;
            if(dd)
                return ;
         }     
    }
    return ;
}
int main()
{
    int i,j,t,q;
    int tt;
    while(scanf("%d%d%d",&a,&b,&c),a || b || c){
        getchar();
        memset(d,'\0',sizeof(d));
        memset(bo,0,sizeof(bo));
        ee = rr = tt = t = q = dd = 0;
        for(i = 0 ;i < a ;i ++){
            for(j = 0;j < b;j ++){
                scanf("%c",&d[i][j]);
                if(d[i][j] == 'S'){
                    t = i;
                    q = j;
                }
                if(d[i][j] == 'D'){
                    ee = i;
                    rr = j;
                }
                if(d[i][j] == 'X')
                    tt ++;
            }
            getchar();
        }
        if(a * b - tt <= c){
            printf("NO\n");
            continue;
        }
        bo[t][q] = 1;    
        dfs(t,q,0);
        if(dd)
            printf("YES\n");
        else
            printf("NO\n");
    } 
    return 0;
}