杭电1010-Tempter of the Bone(BFS)

Tempter of the Bone


Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 91716    Accepted Submission(s): 24937

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<cstdio>
#include<cmath>
#include<cstring>
char cmap[10][10];
int m,n,s,mov[4][2]={1,0,-1,0,0,1,0,-1};
int vis[10][10],flag,sx,sy,ex,ey;
bool can(int x,int y)//判断当前点能不能走
{
	if(x<0||x>m-1||y<0||y>n-1||cmap[x][y]=='X'||vis[x][y])
	return false ;
	return true ;
}
void dfs(int x,int y,int step)
{
	if(cmap[x][y]=='D')
	{
		if(step==s)
		{
			flag=1;
			return ;
		}
		return ;
	}
	int xx,yy,i;
	
	int as=abs(x-ex)+abs(y-ey);
	if((s-as-step)%2||as+step>s)//奇偶剪枝
	return ;
	
	if(flag)//记得加上这一句优化
	return ;
	
	for(i=0;i<4;i++)
	{
		xx=x+mov[i][0];
		yy=y+mov[i][1];
		if(can(xx,yy))
		{
			vis[xx][yy]=1;
			dfs(xx,yy,++step);
			vis[xx][yy]=0;
			step--;
		}
	}
}
int main()
{
	int i,j;
	while(scanf("%d%d%d",&m,&n,&s),m||n||s)
	{
		memset(vis,0,sizeof(vis));
		for(i=0;i<m;i++)
		{
			scanf("%s",cmap[i]);
			for(j=0;j<n;j++)
			{
				if(cmap[i][j]=='S')
				{
					sx=i;
					sy=j;
				}
				if(cmap[i][j]=='D')
				{
					ex=i;
					ey=j;
				}
			}
		}
		flag=0;
		vis[sx][sy]=1;
		int best=abs(ex-sx)+abs(ey-sy);
		if((best+s)&1)//判断开始能否到达,如果不能就continue!
		{
			 printf("NO\n");
			 continue;
		}
		dfs(sx,sy,0);
		if(flag)
		printf("YES\n");
		else
		printf("NO\n");
	}
	return 0;
}

    原文作者:BFS
    原文地址: https://blog.csdn.net/nvliba/article/details/48532593
    本文转自网络文章,转载此文章仅为分享知识,如有侵权,请联系博主进行删除。
点赞