dfs hdu1312 Red and Black

最新推荐文章于 2021-01-26 15:55:45 发布

原创最新推荐文章于 2021-01-26 15:55:45 发布 · 296 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

dfs深搜专栏收录该内容

16 篇文章

订阅专栏

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above.

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
The end of the input is indicated by a line consisting of two zeros.

Output

For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).

Sample Input
6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0
Sample Output
45
59
6

题意概括："@"为出发点,"."为路，"#"为墙，问从@出发能到多少地方？

代码：

#include<stdio.h>
#include<string.h>
int m,n,t,l,book[50][50];
char s[50][50];
void dfs(int x,int y,int step)
{
	//printf("%d %d\n",x,y);
	int tx,ty,k;
	int next[4][2]={{0,1},{1,0},{0,-1},{-1,0}};

	for(k=0;k<=3;k++)
	{
		tx=x+next[k][0];
		ty=y+next[k][1];
		if(tx>m||tx<1||ty>n||ty<1)
			continue;
		//printf("%d %d\n\n",tx,ty);
		if(s[tx][ty]=='.'&&book[tx][ty]==0)
		{
			book[tx][ty]=1;
			t++;
			dfs(tx,ty,step+1);	
			//book[tx][ty]=0;
		}	
		
	} 
	return ;

}
int main()
{
	int i,j,k,x1,y1;
	
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		if(n==0&m==0)
			break;
		t=1;
		memset(book,0,sizeof(book));
		for(i=1;i<=m;i++)
		{
			scanf("\n");
			for(j=1;j<=n;j++)
			{
				scanf("%c",&s[i][j]);
				if(s[i][j]=='@')
				{
					s[i][j]='.';
					x1=i;y1=j;
				}
			}
		}
		
		//printf("%d %d\n",x1,y1);
		book[x1][y1]=1;
		dfs(x1,y1,1);
		printf("%d\n",t);
		getchar();
	}
	
	return 0;
}