hdu 1312 Red and Black

Red and Black

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

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>
#define MAX 30
char map[MAX][MAX];
int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
int cont,w,h;

void dfs(int a,int b)
{
	map[a][b] = '#';
	cont++;
	for(int k=0;k<4;k++)
	{
		int x = a+dir[k][0];
		int y = b+dir[k][1];
		if(x<=h && y<=w && x>=1 && y>=1 && map[x][y]=='.')
			dfs(x,y);
	}
}
int main()
{
	int i,j;
	int a,b;
	while(scanf("%d%d",&w,&h)&&w||h)
	{
		getchar();
		memset(map,0,sizeof(map));
		for(i=1;i<=h;i++)
		{
			for(j=1;j<=w;j++)
			{
				scanf("%c",&map[i][j]);
				if(map[i][j]=='@')
				{
					a = i;
					b = j;
				}
			}
			getchar();
		}
		cont=0;
		dfs(a,b);
		printf("%d\n",cont);
	}
	return 0;
}