Red and Black（dfs）

Red and Black

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20666    Accepted Submission(s): 12563

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
   
    
  
  

/**************************************************************
Problem:Red and Black
Language: C/C++
method: dfs
date:2017 7 18 
create by Songdan_Lee
和油田问题相似，只需要从起始位置dfs，每次dfs时加1，记录black square的数目即可。
总的数目还要加1，包括起始位置 
****************************************************************/
#include<stdio.h>
#include<string.h>

int dir[4][2]={-1,0,1,0,0,-1,0,1};
char map[25][25];
int n,m;

typedef struct Node{
	int x;
	int y;
	
}st;

st start;
int ans;
void dfs(int x,int y){
	map[x][y]='#';
	ans++;
	
	for(int i=0;i<4;i++)
	{
		int xx=x+dir[i][0];
		int yy=y+dir[i][1];
		
		if(map[xx][yy]=='#'||xx<0||yy<0||xx>=n||yy>=m)continue;
		
		dfs(xx,yy);
	}
		
}




int main(){
	while(scanf("%d%d",&m,&n)!=EOF){
		
		if(m==0&&n==0)
		break;
		
		for(int i=0;i<n;i++)
		scanf("%s",map[i]);
		
		for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
		{
			if(map[i][j]=='@')
			{
				start.x=i;
				start.y=j;
			}
		}
		
		ans=0;
		dfs(start.x,start.y);
		printf("%d\n",ans);
		
	}
}