算法题 深/广搜-01-Red and black

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>
int n, m;
char map[21][21] = { 0 };
int step=0;
void dfs(int x, int y) {
	map[x][y] = '#';
	int k;
	int next_x,next_y;
	int dir[4][2]{ {-1,0},{1,0},{0,-1},{0,1} };
	for (k = 0; k < 4; k++) {
		next_x = x + dir[k][0];
		next_y = y + dir[k][1];
		if (0<=next_x&&next_x < m&&0<=next_y && next_y < n && map[next_x][next_y] == '.') {
			step = step + 1;
			dfs(next_x, next_y);
		}
	}
}
int main() {
	while (scanf("%d %d", &n, &m)!=EOF) {
		if (n == 0 && m == 0) {
			break;
		}
		int i, j;
		step = 0;
		for (i = 0; i < m; i++) {
			scanf("%s", map[i]);
		}
		for (i = 0; i < m; i++) {
			for (j = 0; j < n; j++) {
				if (map[i][j] == '@') {
					dfs(i, j);
				}
			}
		}
		printf("%d\n",step+1);
	}
	return 0;
}