【hdu 1312】 Red and Black （dfs+bfs）

最新推荐文章于 2024-02-20 18:00:32 发布

原创最新推荐文章于 2024-02-20 18:00:32 发布 · 294 阅读

0 ·

CC 4.0 BY-SA版权

DFS&BFS 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个基于深度优先搜索算法的程序，该程序用于计算在一个由黑色和红色方块组成的矩形房间中，从一个指定的黑色方块出发可以到达的所有黑色方块的数量。通过递归的方式遍历所有可达的黑色方块。

A - Red and Black

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)

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

代码：

#include<cstdio>

int x_move[4]={0,0,1,-1};
int y_move[4]={1,-1,0,0};
int w,h,num,i,j;
char map[25][25];
void dfs(int x,int y)
{
	if(x<0||y<0||x>=w||y>=h)
	    return ;
	if(map[x][y]=='#')
	    return ;
	map[x][y]='#';
	num++;
	for(int i=0;i<4;i++)
	    dfs(x+x_move[i],y+y_move[i]);
}
int main()
{
	while(~scanf("%d%d",&h,&w)&&h&&w)
	{
		num=0;
		for(i=0;i<w;i++)
		   scanf("%s",map[i]);  
		for(i=0;i<w;i++)
		{
			for(j=0;j<h;j++)
			{
				if(map[i][j]=='@')
				dfs(i,j);
			}
		}
		printf("%d\n",num);
	}
	return 0;
}