POJ-1979 Red and Black

最新推荐文章于 2020-02-14 19:10:38 发布

hobby_Z

最新推荐文章于 2020-02-14 19:10:38 发布

阅读量185

点赞数

分类专栏： DFS/BFS 文章标签： dfs

本文链接：https://blog.csdn.net/h_bby/article/details/103955659

版权

DFS/BFS 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Red and Black（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.

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

Output

题目大意
求出 @ 能活动的格子数，< . >为可走的格子，< # >为障碍
题目分析
深搜并记录每个走过的格子，再设置一个计数器记录格子数，每遇到没走过的格子就让格子数加1，最后输出格子数。
代码

#include<cstdio>
#include<iostream>
using namespace std;

int cnt;
char c[30][30];
int W,H;

void dfs(int x,int y)
{
	int d[4][2]={ {1,0},{0,1},{-1,0},{0,-1} };
	for(int i=0;i<4;i++)
	{
		int X=x,Y=y;
		X+=d[i][0];Y+=d[i][1];
		if(X>=0&&X<H&&Y>=0&&Y<W&&c[X][Y]=='.'){
			c[X][Y]='#';
			cnt++;
			dfs(X,Y);
		}
	}
} 

int main()
{
	while(scanf("%d %d",&W,&H))
	{
		cnt=1;
		if(W==0&&H==0)break;
		for(int i=0;i<H;i++)
		{
			scanf("%s",c[i]);
		}
		
		for(int i=0;i<H;i++)
		{
			for(int j=0;j<W;j++)
			{
				if(c[i][j]=='@'){
					dfs(i,j);
				}
			}
		}
		printf("%d\n",cnt);
		
	}
	
	return 0;
}