Red and Black

G
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

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define MAX	20;
int n, m, sum;
int dir[4][2] = {-1, 0, 0, 1, 1, 0, 0, -1};
int vis[20][20] ;
char mps[20][20];
bool check (int x, int y) {
	if (x >= 0 && x < m && y >= 0 && y < n)
		return true;
	else
		return false;
}
void dfs (int x, int y) {
	sum++;
	vis[x][y] = 1;
	int i, x1, y1;
	for (i = 0; i < 4; i++) {
		x1 = x + dir[i][0];
		y1 = y + dir[i][1];
		if (check(x1, y1) && vis[x1][y1] == 0) {
			dfs(x1, y1);
		}
	}
	return ;
}
int main () {
	int i, j, x ,y;
	while (scanf("%d%d", &n, &m) && n != 0 && m != 0) { 
		sum = 0;
		memset(vis, 0, sizeof(vis));
		memset(mps, 0,sizeof(mps)); 
		for (i = 0; i < m; i++) {
			scanf("%s", mps[i]);
		}
		for (i = 0; i < m; i++) {
			for(j = 0; j < n; j++) {
				if (mps[i][j] == '#') {
					vis[i][j] = 1;
				}
				if (mps[i][j] == '@') {
					x = i;
					y = j;
				}
			}
		}
		dfs(x, y);
		cout << sum << endl;
	}
	return 0;
}

阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页