hdu1312Red and Black（搜索DFS）

Red and Black

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

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<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 21
char map[maxn][maxn];
int b1[4]={1,0,-1,0};
int b2[4]={0,1,0,-1};
int ans,w,h;
int dfs(int i,int j)
{
	ans++;
	int t,xx,yy;
	map[i][j]='#';
	for(t=0;t<4;t++)
	{
		xx=i+b1[t];
		yy=j+b2[t];
		if(xx>=0&&xx<h&&yy>=0&&yy<w&&map[xx][yy]=='.')
		dfs(xx,yy);
	}	
}
int main()
{
	int i,j;
	int p,q;
	while(scanf("%d%d",&w,&h)!=EOF&&w&&h)
	{
		ans=0;
		for(i=0;i<h;i++)
		{
			getchar();
			for(j=0;j<w;j++)
			{
				scanf("%c",&map[i][j]);
				if(map[i][j]=='@')
				{
					p=i;
					q=j;	
				}
			}
		}
		dfs(p,q);
		printf("%d\n",ans);
	}
	return 0;
}