hdu1010 Tempter of the Bone

Tempter of the Bone

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


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
 
题意:

有一只狗要走到‘D’处,一秒钟走一步,但‘D’处的门之在T秒后开放,问狗从‘S’处出发,能否按时走到门处逃出。


************************************************************************************************************************************************************************************

这题算是搜索里接触的一类新东西了——剪枝。

剪枝是什么?

剪枝就是将地图上的各个点,从起点开始所要到达各点的步数是奇数还是偶数,分别用1和0来表示。

例如本体样例一:

0101

1010

0101

1010

从起点到终点需要奇数步,那么如果时间是偶数,那么偶数时间的样例可以直接Pass掉了。

可见剪枝是一个很不错方法能直接排除一下样例,节俭时间。

*************************************************************************************************************************************************************************************

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>

using namespace std;
const int maxn=10;
int block;int flag;
int x[4]={-1,0,0,1},y[4]={0,-1,1,0};int sx,sy,ex,ey;
int n,m,t;
char map[maxn][maxn];
void dfs(int a,int b,int k)
{
    if(a==ex&&b==ey&&k==t)
    {
        flag=1;
        return ;
    }
    if(k>=t)return ;
    if(a<0||a>=n||b<0||b>=m||flag==1)return ;
    if(map[a][b]=='X')return ;
    for(int i=0;i<4;i++)
    {
        map[a][b]='X';
        dfs(a+x[i],b+y[i],k+1);
        
        map[a][b]='.';
        if(flag==1)return ;//如果已经确认可以按时走到门了,就直接可以返回了;
    }
}

int main()
{
    while(1)
    {
        scanf("%d%d%d",&n,&m,&t);
        if(n==0&&m==0&&t==0)break;

        for(int i=0;i<n;i++)
        {
            scanf("%s",map[i]);
            for(int j=0;j<m;j++)
            {
                if(map[i][j]=='S'){sx=i;sy=j;}//记录起点位置
                if(map[i][j]=='D'){ex=i;ey=j;}//记录终点位置
            }
        }
        int step=abs(sx-ex)+abs(sy-ey);
        if(step>t||(sx+sy+ex+ey+t)%2!=0)//剪枝
        {printf("NO\n");continue;}

        flag=0;
        dfs(sx,sy,0);
        if(flag==1)
        printf("YES\n");
        else
        printf("NO\n");
    }

    return 0;
}











评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值