Red and Black HDU - 1312题解

题目

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

45
59
6
13

思路

题意就是：‘.’ 表示黑色瓷砖，‘#’表示红色瓷砖，‘@’表示起点。
遍历整个图，只能上下左右移动，计算他能走到的黑砖的个数。
用bfs遍历整个图，遇到黑色瓷砖累加器++即可。
需要使用队列，广度优先搜索等知识点。

代码

#include"bits/stdc++.h"
using namespace std;
	char room[23][23];
	int dir[4][2]={{-1,0},{0,-1},{1,0},{0,1}};
	int wx,hy,num;
	struct node{
		int x,y;
	};
	#define check(x,y) (x<wx&&x>=0&&y>=0&&y<hy)
	void dfs(int dx ,int dy){
		room[dx][dy]='#';
		num++;
		for(int i=0;i<4;i++){
			int newx=dx+dir[i][0];
			int newy=dy+dir[i][1];
			if(check(newx,newy)&&room[newx][newy]=='.'){
				dfs(newx,newy);
			}
		}
	} 
int main(){
	int x,y,dy,dx;
	while(cin>>wx>>hy){
		if(wx==0&&hy==0){
			break;
		}
		for(y=0;y<hy;y++){
			for(x=0;x<wx;x++){
				cin>>room[x][y];
				if(room[x][y]=='@'){
					dx=x;
					dy=y;
				}
			}
		}
		num=0;
		dfs(dx,dy);
		cout<<num<<endl;
	}
return 0;
}