HDOJ-1312(Red and Black)(dfs)

Red and Black

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

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
  
  

 

My   solution:

/*2016.3.3*/

#include<stdio.h>
#include<string.h>
char map[22][22];
int step,n,m,b[4]={0,1,0,-1},d[4]={1,0,-1,0};
void dfs(int x,int y)
{
	int i;
	if(x<0||x>=n||y<0||y>=m)
	return ;
	if(map[x][y]=='#')
	return ;
	step++;
	map[x][y]='#';
	for(i=0;i<4;i++)
	dfs(x+b[i],y+d[i]);
}
int main()
{
	
	int i,j,k,x1,y1;
	while(scanf("%d%d",&m,&n)==2&&(n||m))
	{
		for(i=0;i<n;i++)
		{
		       getchar();
			   for(j=0;j<m;j++)
			  {
					scanf("%c",&map[i][j]);
					if(map[i][j]=='@')
					{
						x1=i;
						y1=j;
					}
			  }
			
		}
	    step=0;
		dfs(x1,y1);
		printf("%d\n",step);	
	}
	return 0;
}