Red and Black（DFS）

Red and Black

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

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
   
   
   
   


   
   
   
   


   
   

<span style="font-family:Comic Sans MS;font-size:14px;">#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int m, n, x, y;
char map[21][21];
int check[21][21];
int ans = 0;
void dfs(int i, int j)
{

	if (map[i][j + 1] == '.'&&check[i][j + 1] == 0)
	{
		ans++;
		check[i][j + 1] = 1;
		dfs(i, j + 1);
	}
	if (map[i][j - 1] == '.'&&check[i][j - 1] == 0)
	{
		ans++;
		check[i][j - 1] = 1;
		dfs(i, j - 1);
	}
	if (map[i - 1][j] == '.'&&check[i - 1][j] == 0)
	{
		ans++;
		check[i - 1][j] = 1;
		dfs(i - 1, j);
	}
	if (map[i + 1][j] == '.'&&check[i + 1][j] == 0)
	{
		ans++;
		check[i + 1][j] = 1;
		dfs(i + 1, j);
	}


}



int main()
{
	memset(check, 0, sizeof(check));
	memset(map, '#', sizeof(map));
	int i, j;
	while (scanf("%d%d", &m, &n))
	{
		getchar();
		for (i = 1; i <= n; i++)
		{
			for (j = 1; j <= m; j++)
			{
				scanf("%c", &map[i][j]);
			}
			getchar();//这个不能少......低级错误调试了半个多小时，还以为闹鬼了........
		}
		for (i = 1; i <= n; i++)
		{
			for (j = 1; j <= m; j++)
			if (map[i][j] == '@')
			{
				ans++;
				check[i][j] = 1;
				dfs(i, j);
				i = n;
				j = m;
			}
		}

		printf("%d\n", ans);
	}
	return 0;
}

</span><span style="font-family:Arial;font-size: 14px;">




</span>