Red and Black（HDU1312） DFS简单题

                                                                       Red and Black

Problem Description

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

这是简单的dfs题，搜索每一个点，是的话加1；

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int xy[4][2] ={1,0,-1,0,0,1,0,-1};
char s[105][105];
int n,m,ans,vis[105][105]; 
void dfs(int x,int y){
		for(int i = 0;i < 4;i++){
			int a = x + xy[i][0];
			int b = y + xy[i][1];
			if(a >= 1 && a <= m && b >= 1 && b <= n)        //判断这个点是否还在这个矩阵里
			if(!vis[a][b] && s[a][b] == '.'){          // 判断这个点是否走过，如果是“.”，就迭代。
				vis[a][b] = 1;                // 对于每个走过的点都标记一下。
				ans++;
				dfs(a,b);
			}
		}
	return ; 
} 
int main(){
	int x , y;
	while(cin >> n>>m && m && n){
		memset(vis,0,sizeof(vis));
		ans = 1;
		for(int i = 1;i <= m; i++)
			for(int j = 1; j <= n;j++){
				cin >> s[i][j];
				if(s[i][j] == '@'){
					x = i;
					y = j;
				}
			}
		dfs(x,y);
		cout << ans<<endl;
	}
	return 0;
}