POJ 1979 Red and Black（dfs收索）

Red and Black

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 30009		Accepted: 16305

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) 
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

Sample Output

45
59
6
13

AC代码：

#include<stdio.h>
#include<string.h>
#define M 30
int vis[M][M],sx,sy;
char map[M][M];
int ans;
int n,m;
void dfs(int x,int y)
{
	
	if(x<0||x>=m||y<0||y>=n||vis[x][y]||map[x][y]=='#')
	   return;
	vis[x][y]=1;
	ans++;
       dfs(x-1,y);
       dfs(x+1,y);
       dfs(x,y-1);
       dfs(x,y+1);
}
int main()
{

	while(scanf("%d%d",&n,&m)!=EOF)
	{
		if(n==0&&m==0)
		   break;
		int falg=0;
		memset(map,'\0',sizeof(map));
		memset(vis,0,sizeof(vis));
		for(int i=0;i<m;i++)
		   scanf("%s",map[i]);
		ans=0;
		for(int i=0;i<m;i++)
		{
			for(int j=0;j<n;j++)
		    {
		    	if(map[i][j]=='@')
		    	{
		    		 sx=i;
		    		 sy=j;
		    		 falg=1;
		    		 break;
				}
			 } 
			 if(falg)
			    break; 
		}
		dfs(sx,sy);
		printf("%d\n",ans);  
	}
}