A - Red and Black HDU - 1312

Red and Black

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 21081    Accepted Submission(s): 12848

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
  
  
  
  

   
   

  
  
  
  

   
   

  
  
  
  

   
   
   
   
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100;
char s[maxn][maxn];
int vis[maxn][maxn];
int n,m,ex,ey,flag,ans;
int fx[4]={0,0,-1,1},fy[4]={-1,1,0,0};//四个方向 
void dfs(int x,int y)
{
	vis[x][y]=1;//标记被搜索过 
	for(int i=0;i<4;i++)
	{
		int xx=x+fx[i],yy=y+fy[i];//找到搜的下一个点 
		if(xx>=0 && yy>=0 && xx<n && yy<m && vis[xx][yy]==0 && s[xx][yy]=='.')//如果在范围内，并且没被搜索过，搜索到的下一个是'.'则加一 
		{
			ans++;
			dfs(xx,yy);
		}
	}	
}
int main()
{
	while( ~scanf("%d%d",&m,&n),n+m )
	{
		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]=='@')
			{
				ex=i;
				ey=j;
			}
		}
		getchar();
		memset(vis,0,sizeof(vis));
		ans=1;
		dfs(ex,ey);
		printf("%d\n",ans);
	}
	return 0;
}