【DFS】RED AND BLACK

最新推荐文章于 2018-08-05 10:37:01 发布

ironcarrot

最新推荐文章于 2018-08-05 10:37:01 发布

阅读量291

点赞数

分类专栏： DFS 文章标签： C语言算法 dfs

本文链接：https://blog.csdn.net/IronCarrot/article/details/53475843

版权

DFS 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

//首先，这是一个模版题，顺便我也总结一下DFS

//这题有点类似于BFS

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.

------

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)

--------

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).

--------

6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0

------

------

#include <iostream>
#include <queue>
#include <cstdio>
using namespace std;
char maps[25][25];
int  book[25][25];
int  w,h;
int  dir[4][2]={1,0,0,1,-1,0,0,-1};
int tx,ty;
void dfs(int y,int x)//x代表横着的，y代表纵向的
{
	int i;
	int sum=0;
	for(i=0;i<4;i++)
	{
		 tx=x+dir[i][0];
		 ty=y+dir[i][1];
		if(tx<0 || ty<0 || tx>=h     || ty>=w 
			    || maps[tx][ty]=='#' || book[tx][ty]==1)
				continue;
		book[tx][ty]=1;
		dfs(tx,ty);
	}
}
int main()
{
	while(1)
	{
		int sum=0;
		memset(book,0,sizeof(book));
		int i=0;
		int sx,sy;
		scanf("%d %d",&h,&w);
		if(w==0 && h==0)
			break;
		for(i=0;i<w;i++)
		{
			scanf("%s",&maps[i]);
		}
		int k=0;
		for(k=0;k<h;k++)
		{
			if(maps[i][k]=='@')
			{
				sx=k;
				sy=i;
			}
			i++;
			sum++;
			book[ty][tx]=1;
			dfs(ty,tx);
		}
		
		printf("%d\n",sum);
	}
	return 0;
}