Red and Black （DFS模板题）

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

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int vis[30][30];
char maze[30][30];
int ans;
int n,m;
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void DFS(int sx,int sy)
{
	vis[sx][sy]=1;
	ans++;
	for (int i=0;i<4;i++)
	{
		int nx = sx + dx[i];
		int ny = sy + dy[i];
		if (0<=nx && nx<n && 0<=ny && ny<m && maze[nx][ny]!='#' && vis[nx][ny]!=1)
			DFS(nx,ny);
	}
}
int main()
{
	while(scanf("%d %d",&m,&n)!=EOF && n+m!=0)
	{
		int i,j,sx,sy;
		memset(vis,0,sizeof(vis));
		for (i=0;i<n;i++)
			scanf("%s",maze[i]);
		for (i=0;i<n;i++)
			for (j=0;j<m;j++)
				if (maze[i][j]=='@')
				{
					sx = i;
					sy = j;
				}
		ans = 0;
		DFS(sx,sy);
		printf("%d\n",ans);
	} 
	return 0;
}