zoukankan      html  css  js  c++  java
  • hdu1010

    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<bits/stdc++.h>
    using namespace std;
    char a[8][8];
    int n,m,t,r0,c0,rl,cl,flag;
    void dfs(int r,int c,int temp)
    {
    	if(r<0||r>n-1||c<0||c>m-1||temp<0) return;
    	if((temp-abs(r-rl)-abs(c-cl))%2!=0) return;
    	if(temp==0&&r==rl&&c==cl)  {flag=1;return;}
    	if(temp==0||a[r][c]=='X') return;
    	a[r][c]='X';
    	if(a[r-1][c]!='X') dfs(r-1,c,temp-1);
    	if(a[r+1][c]!='X') dfs(r+1,c,temp-1);
    	if(a[r][c+1]!='X') dfs(r,c+1,temp-1);
    	if(a[r][c-1]!='X') dfs(r,c-1,temp-1);
    	a[r][c]='.';
    }
    int main()
    {
    	while(scanf("%d%d%d",&n,&m,&t)==3)
    	{
    		if(n==0&&m==0&&t==0) break;
    		flag = 0;
    		memset(a,0,sizeof(a));
    		for(int i =0;i<n;i++)
    		{
    			scanf("%s",&a[i]);
    		}
    		for(int i =0;i<n;i++)
    		{
    			for(int j = 0;j<m;j++)
    			{
    				if(a[i][j]=='S') {r0=i;c0=j;}
    				if(a[i][j]=='D') {rl=i;cl=j;}
    			}
    		}
    		dfs(r0,c0,t);
    		flag?printf("YES
    "):printf("NO
    ");
    	}	
    	return 0;
    }
    
    我现在最大的问题就是人蠢而且还懒的一批。
  • 相关阅读:
    回归cnblog
    第一篇博文
    apache 配置网站目录,虚拟目录,新端口
    linux 虚拟机设置IP访问外网
    Volist标签 key值的使用
    php header调试,yii2打log
    Yii2 框架下bootstrap 弹窗预览视频等~
    几个简单的css设置问题:div居中,ul li不换行 ,内容超出自动变省略号等
    鼠标右键弹窗(实现重命名等)的设计
    HTML5 Canvas绘图系列之一:圆弧等基础图形的实现
  • 原文地址:https://www.cnblogs.com/pot-a-to/p/10937074.html
Copyright © 2011-2022 走看看