Red and Black

Red and Black

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：

#include <cstdio>
#include <cstring>
const int MAX=1e2;
char s[MAX][MAX];
int vis[MAX][MAX];
int m,n,ans;
int fx[4]={0,0,-1,1},fy[4]={-1,1,0,0};
void dfs(int x,int y)
{       
         vis[x][y]=1;
           ans++;
	    for(int i = 0; i < 4; i++)
	    {
	    	int xx=fx[i]+x,yy=fy[i]+y;
	    	if( xx >= 0&& yy >= 0 && xx < n&& yy < m&& s[xx][yy]== '.' &&!vis[xx][yy])
	    	      {
	    	      	  
				      dfs(xx,yy);
				  }
		}
	
}
int main()
{  

    while(~scanf("%d %d",&m,&n)&&(m||n))
    {    
     memset(vis,0,sizeof(vis));
          ans=0;
    	  for(int  i = 0; i < n ; i++)
    	  {   		
    	  	  scanf("%s",s[i]);
		  } 
    	   for(int i = 0;i < n ; i++)
    	     for(int j =0 ;j < m; j++)
            {    
			      if(s[i][j]=='@'&&!vis[i][j])
                  {    
                        dfs(i,j);
				  }        	
		 }	 
		           
		         
					 printf("%d\n",ans);
	}               
	return 0;
}

BFS：

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int MAX=1e2;
char s[MAX][MAX];
int vis[MAX][MAX];
int m,n,ans;
int fx[4]={0,0,-1,1},fy[4]={-1,1,0,0};
struct  node
{
	 int x,y;
} st,w;
void bfs(int x,int y)
{       
         vis[x][y]=1;
         queue <node> q;
           st.x=x;
           st.y=y;
           q.push(st);	
           while(!q.empty())
           {     
           	     st=q.front();
           	     ans++;
           	     q.pop();
	          for(int i = 0; i < 4; i++)
	    {
	    	 int xx=fx[i]+st.x,yy=fy[i]+st.y;
	    	if( xx >= 0&& yy >= 0 && xx < n&& yy < m&&!vis[xx][yy]&& s[xx][yy]== '.' )
	    	      {
	    	      	  vis[xx][yy]=1;
				       w.x=xx,w.y=yy;
				       q.push(w);
				  }
		}
     }
}
int main()
{  
   int f1,f2;
    while(~scanf("%d %d",&m,&n)&&(m||n))
    {    
     memset(vis,0,sizeof(vis));
          ans=0;
    	  for(int  i = 0; i < n ; i++)
    	  {   		
    	  	  scanf("%s",s[i]);
		  } 
    	   for(int i = 0;i < n ; i++)
    	     for(int j =0 ;j < m; j++)
            {    
			      if(s[i][j]=='@')
                  {    
                        f1=i,f2=j;
				  }        	
		 }	 
		            bfs(f1,f2);
		         
					 printf("%d\n",ans);
	}               
	return 0;
}

注意两者的不同点