Red and Black【杭电1312】

题目连接：点击打开链接

Red and Black

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

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
  
  

 

Source

Asia 2004, Ehime (Japan), Japan Domestic

 

Recommend

Eddy   |   We have carefully selected several similar problems for you:   1241  1016  1010  1372  1242 

dfs水题，，，

这道题让我找bug找了好久。。。

#include<cstdio>
#include<cstring>
using namespace std;
char grid[30][30];
int w,h,cnt;
int dir[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
void dfs(int x,int y)
{
	cnt++;
	grid[x][y]='#';
	for(int t=0;t<4;t++){
		int xx=x+dir[t][0];
		int yy=y+dir[t][1];
		if(xx>=0 && yy>=0 && xx<h && yy<w && grid[xx][yy]=='.')
			dfs(xx,yy);
	}
	return ;
}
int main()
{
	int stx,sty,i,j;
	while(~scanf("%d%d%*c",&w,&h)){
		if(w==0&&h==0){
			break;
		}
		for(i=0;i<h;i++)
		{
			for(j=0;j<w;j++)
			{
				scanf("%c",&grid[i][j]);
				if(grid[i][j]=='@')
				{
					stx=i;
					sty=j;			
				}
			}
			getchar();
		}
	cnt=0;
	dfs(stx,sty);
	printf("%d\n",cnt);
	}
	return 0;
}