POJ 1979 Red and Black

POJ 1979 Red and Black

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

Thinking : 第一次写的时候，输出结果后res顺手等0，WA了好几次也没看出来，加油，我是咸鱼，希望自己能每天做一道题，最少一星期五道题。今天突然发现第一个人关注我：)

#include<cstdio>

const int maxn = 23;
int W, H;
int x, y;
int res = 1;
char m[maxn][maxn];
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};

void dfs(int x, int y){
    for(int d = 0; d < 4; d++){
        int xx = x + dx[d];
        int yy = y + dy[d];
        if(0 <= xx && xx < H && 0 <= yy && yy < W && m[xx][yy] == '.'){
            res++;
            m[xx][yy] = '#';
            dfs(xx, yy);            
        }
    }
}

int main(){
    while(scanf("%d%d", &W, &H) == 2 && W != 0 && H != 0){
        getchar();
        for(int i = 0; i < H; i++){
            for(int j = 0; j < W; j++){
                scanf("%c", &m[i][j]);
                if(m[i][j] == '@'){
                    x = i;
                    y = j;
                }
            }
            getchar();
        }
        dfs(x, y);
        printf("%d\n", res);
        res = 1;
    }
    return 0;
}