POJ 1979 - Red and Black

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 21419		Accepted: 11455

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) 
The end of the input is indicated by a line consisting of two zeros. 

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

Japan 2004 Domestic

#include <iostream>
#include <string>
#include <cstring>
#define maxr 25
#define maxc 25
using namespace std;
int row,col,counts=0;
bool visited[maxr][maxc];
string map[maxr];

void dfs(int x,int y)
{
	if(x<0||x>=row||y<0||y>=col||map[x][y]=='#'||visited[x][y])return;
	visited[x][y]=1;
	counts++;
	
	dfs(x-1,y);
	dfs(x+1,y);
	dfs(x,y-1);
	dfs(x,y+1);
}

int main()
{
	while(cin>>col>>row,row||col)
	{
		int x,y;
		for(int i=0;i<row;i++){
			cin>>map[i];
			for(int j=0;j<col;j++){
				if(map[i][j]=='@'){
					x=i;
					y=j;
				}
			}
		}
		memset(visited,0,sizeof(visited));
		counts=0;
		dfs(x,y);
		cout<<counts<<endl;
	}
	return 0;
}