• HDU 题目1010 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): 125699 Accepted Submission(s): 33910

    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

    杭电1010这一题的题目大意是:一条狗进入一个神奇的迷宫,一秒走一个空白的地方,狗走过的地方会消失,也就是说狗不能往回走,门在T秒之后打开,且打开很短的时间,狗只有在T秒的时候到达才能离开。

    #include<algorithm>
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<queue>
    using namespace std;
    char mapp[10][10];
    int state[10][10];
    int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
    int n,m,time,num;
    int xx,yy,xxx,yyy;
    bool tu;
    int abs(int a)
    {
        return a>0?a:-a;
    }
    void bfs(int x,int y,int sum)
    {
        if(tu)
            return ;
        if(x==xxx&&y==yyy&&sum==time)
        {
            tu=true; return ;
        }
        int summ=abs(xxx-x)+abs(yyy-y);
        if(summ>time-sum||(summ+time-sum)%2!=0)
            return ;
        int x1,y1;
        for(int i=0;i<4;i++)
        {
            x1=x+dir[i][0];
            y1=y+dir[i][1];
            if(x1>=0&&x1<n&&y1>=0&&y1<m&&state[x1][y1]==0&&mapp[x1][y1]!='X')
            {
                state[x1][y1]=1;
                bfs(x1,y1,sum+1);
                state[x1][y1]=0;
            }
        }
    }
    int main()
    {
        while(scanf("%d%d%d",&n,&m,&time)!=EOF)
        {
            if(n==0&&m==0&&time==0)
                break;
            tu=false;
            num=0;
            memset(mapp,0,sizeof(mapp));
            for(int i=0;i<n;i++)
            {
                scanf("%s",mapp[i]);
                for(int j=0;j<m;j++)
                {
                    state[i][j]=0;
                    if(mapp[i][j]=='S')
                    {
                        xx=i;
                        yy=j;
                    }
                    if(mapp[i][j]=='D')
                    {
                        xxx=i;
                        yyy=j;
                    }
                    if(mapp[i][j]=='X')
                        num++;
                }
            }
            if(num+time+1>n*m)
            {
                printf("NO
    "); continue;
            }
            state[xx][yy]=1;
            bfs(xx,yy,0);
            if(tu)
                printf("YES
    ");
            else
                printf("NO
    ");
        }
        return 0;
    }
  • 相关阅读:
    设计模式之工厂模式(Factory Pattern)用C++实现
    读书笔记之Effective C++ 1.让自己习惯C++
    LeetCode之RemoveDuplicates扩展
    一致性哈希(Consistent Hashing)原理和实现(整理)
    LeetCode之Remove Duplicates from Sorted Array
    C++小结
    HTTP、HTTP1.0、HTTP1.1、HTTP2.0——笔记
    《趣谈网络协议》——问答笔记
    技术源于生活(头脑风暴)
    解决:未能加载文件或程序集“System.Web.Http, Version=5.2.4.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35”或它的某一个依赖项。找到的程序集清单定义与程序集引用不匹配。 (异常来自 HRESULT:0x80131040)
  • 原文地址:https://www.cnblogs.com/nanfenggu/p/7900096.html
Copyright © 2020-2023  润新知