zoukankan      html  css  js  c++  java
  • HDU 1010 Tempter of the Bone(DFS)

    题目链接

    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
     

    题解:DFS,注意剪枝,否则超时。

    #include <cstdio>
    #include <iostream>
    #include <string>
    #include <cstring>
    #include <stack>
    #include <queue>
    #include <algorithm>
    #include <cmath>
    #include <map>
    using namespace std;
    //#define LOCAL
    char Map[10][10];
    int N,M,T,si,sj,ti,tj;
    bool flag;
    int dir[4][2]= {{0,1},{0,-1},{-1,0},{1,0}};
    void dfs(int i,int j,int cnt)
    {
        if(i==ti&&j==tj&&cnt==T)
        {
            flag=true;
            return;
        }
        if(i<=0||j<=0||i>N||j>M)return;
        int temp=(T-cnt)-abs(i-ti)-abs(j-tj);
        if(temp<0||temp%2)return;
        for(int k=0; k<4; k++)
        {
            int ni=i+dir[k][0],nj=j+dir[k][1];
            if(Map[ni][nj]!='X')
            {
                Map[ni][nj]='X';
                dfs(ni,nj,cnt+1);
                if(flag)return;
                else Map[ni][nj]='.';
            }
        }
        return;
    }
    int main()
    {
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
    #endif // LOCAL
        //Start
        while(cin>>N>>M>>T)
        {
            if(N==0)break;
            flag=false;
            int wall=0;
            for(int i=1; i<=N; i++)
                for(int j=1; j<=M; j++)
                {
                    cin>>Map[i][j];
                    if(Map[i][j]=='S')si=i,sj=j;
                    else if(Map[i][j]=='D')ti=i,tj=j;
                    else if(Map[i][j]=='X')wall++;
                }
            if(N*M-wall<=T)
            {
                printf("NO
    ");
                continue;
            }
            Map[si][sj]='X';
            dfs(si,sj,0);
            if(flag)printf("YES
    ");
            else printf("NO
    ");
        }
        return 0;
    }

      

  • 相关阅读:
    可惜老板不看程序员写的书
    《让僵冷的翅膀飞起来》系列之四——Visitor模式之可行与不可爱
    《让僵冷的翅膀飞起来》系列之二——从实例谈Adapter模式
    策略模式的应用实践
    《让僵冷的翅膀飞起来》系列之三——从Adapter模式到Decorator模式
    用Design+Blend轻松制作环形文字
    silverlight3的"伪"3D续图片横向轮换
    silverlight.net官方网站图片切换源码
    css2.1中的属性选择器(css高手请绕道)
    多线程中的ManualResetEvent
  • 原文地址:https://www.cnblogs.com/gpsx/p/5160607.html
Copyright © 2011-2022 走看看