POJ1979 Red and Black (DFS)

Red and Black

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 35948		Accepted: 19462

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

一道简单的搜索题目，从‘@’处出发开始遍历，把遍历到的'.'变成'#'，记录改变的次数即可。

AC代码如下：

#include <cstdio>
#include <cstring>
using namespace std;

const int MAX_N = 25;

char map[MAX_N][MAX_N];
int n,m,count,dir[4][2] = {1,0,-1,0,0,1,0,-1};

void dfs(int x, int y){
	count ++;
	map[x][y] = '#';
	
	for(int i = 0; i < 4; i ++){
		int dx = x + dir[i][0],dy = y + dir[i][1];
		if(dx >= 0 && dx < m && dy >= 0 && dy < n && map[dx][dy] == '.')
			dfs(dx,dy);
	}
	return ;
}

int main(){
	while(~scanf("%d%d",&n,&m)){
		if(!n && !m)
			break;
		int startx,starty;
		count = 0;
		for(int i = 0; i < m; i ++){
			getchar();
			for(int j = 0; j < n; j ++){
				scanf("%c",&map[i][j]);
				if(map[i][j] == '@'){
					startx = i;
					starty = j;
				}
			}
		}
		dfs(startx,starty);
		printf("%d\n",count);
	}
	return 0;
}