HDU1312 Red and Black

Promblem 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<iostream>
#include<cstring>
using namespace std;
#define MAXN 25
char G[MAXN][MAXN];
bool vis[MAXN][MAXN];
int dis[4][2]={-1,0,1,0,0,-1,0,1};
int dx,dy;
int H,W;
int ans;
void DFS(int x,int y){
	vis[x][y]=1;
	int i;
	for(i=0;i<4;i++){
		dx=x+dis[i][0];
		dy=y+dis[i][1];
		if(dx>=0&&dx<H&&dy>=0&&dy<W&&G[dx][dy]!='#'&&!vis[dx][dy]){
			ans++;
			DFS(dx,dy);
		}
	}
}
int main(){
	int i,j;
	while(cin>>W>>H&&(W||H)){
		memset(vis,0,sizeof(vis));
		ans=1;
		for(i=0;i<H;i++) cin>>G[i];
		for(i=0;i<H;i++)
			for(j=0;j<W;j++){
				if(G[i][j]=='@'){
					DFS(i,j);
					break;
				}
			}
		cout<<ans<<endl;
	}
	return 0;
}