hdu1010:Tempter of the Bone(dfs)

博客围绕小狗在迷宫中的生存问题展开。迷宫为N×M矩形,小狗起始点为S,门为D,墙为X,走过的地板不能再走。门在第T秒打开,需判断小狗能否正好走T步到达门,输入包含迷宫信息,输出为能否生存的结果。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

http://acm.hdu.edu.cn/showproblem.php?pid=1010

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

题意分析:

S代表小狗,D代表门,X代表墙,走过的地板不能再走,问小狗能不能到达门正好走t步。

 

#include <stdio.h>
#include <string.h> 
#define N 10
char a[N][N];
int book[N][N],next[4][2]={1,0, 0,1, -1,0, 0,-1};
int n, m, t, temp;
void dfs(int i, int j, int s)
{
	int tx, ty, k;
	if(s>t || temp==1)
		return ;
	if(a[i][j]=='D')
	{
		if(s==t)
			temp=1;
		return ;
	}
	for(k=0; k<4; k++)
	{
		tx=i+next[k][0];
		ty=j+next[k][1];
		if(a[tx][ty]!='X' && book[tx][ty]==0 && tx>=0 && ty>=0 && tx<n && ty<m)
		{
			book[tx][ty] = 1;
			dfs(tx, ty, s+1);
			book[tx][ty] = 0;
		}
	}
}
int main()
{
	int i, j;
	while(scanf("%d%d%d", &n, &m, &t)!=EOF)
	{
		memset(book, 0, sizeof(book));
		if(n==0 && m==0 && t==0)
			break;
		for(i=0; i<n; i++)
			scanf("%s", a[i]);
		temp = 0;
		for(i=0; i<n; i++)
			for(j=0; j<m; j++)
				if(a[i][j]=='S')
				{
					book[i][j] = 1;
					dfs(i, j, 0);
					break;
				}
		if(temp == 1)
			printf("YES\n");
		else
			printf("NO\n");				
	}
	return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

张宜强

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值