7.12 B - 广搜/深搜 基础 POJ 1979

B - 广搜/深搜 基础

Time Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 1979

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
..#.#..
..#.#..
###.###
#include <iostream>
using namespace std;

int cnt;
int w, h;
char c[21][21];
void dfs(int x, int y)
{
    //if(c[x][y] = '#' || !(0 <= x && x < w) || !(0 <= y && y < h) )
    if('#' == c[x][y] || !(0 <= x && x < h) || !(0 <= y && y < w) )
    {/*上面这个if语句真是坑爹呀，弄了一小时，先是将c[x][y] == '#'写成了c[x][y] = '#'这种低级错误
        ，以后一定要养成习惯将等号和赋值号区分开，以后一定要强迫自己这样写
        赋值：a = 3;而等于：3 == a;以防自己又犯简单低级错误
        
        二是将(0 <= x && x < h) || !(0 <= y && y < w)写成了(0 <= x && x < w) || !(0 <= y && y < h)
        没有意识到i是行号，j是列号，导致错误*/
        return ;
    }
    c[x][y] = '#';
    cnt++;
    dfs(x -1, y);
    dfs(x + 1, y);
    dfs(x, y + 1);
    dfs(x, y - 1);
}
int main()
{
    while(cin >> w >> h && w != 0 && h != 0)
    {
        cnt = 0;
        int x, y;
        for(int i = 0; i < h; i++)
        {
            for(int j = 0; j < w; j++)
            {
                cin >> c[i][j];
                if(c[i][j] == '@')
                {
                    x = i;
                    y = j;
                }
            }
        }
        dfs(x, y);
        cout << cnt << endl;
    }
    return 0;
}

...@...###.###..#.#....#.#..0 0

Sample Output

45
59
6
13

---