#HDU 1312 Red and Black （联通块问题）

roblem 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)

 

 

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

题目大意 ：计算 ’@‘所在区域的’.‘数量， 包括’@‘本身

水题， 不过有一个地方要注意， 在你判断下一步能不能走的时候， 判断条件必须得用p[xx][yy] == '.', 不可以用p[xx][yy] != '#'， 否则他最后会把‘@’走了。

AC代码 ：

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int maxn = 25;

struct node
{
    int x, y;
};
char p[maxn][maxn];
int n, m, sx, sy, sum;
bool vis[maxn][maxn];
int bfs() {
    int dir[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
    sum = 1;
    memset(vis, 0, sizeof(vis));
    queue <node> q;
    q.push({sx, sy});
    while (!q.empty()) {
        node now = q.front();
        q.pop();
        for (int i = 0; i < 4; i++) {
            int xx = now.x + dir[i][0];
            int yy = now.y + dir[i][1];
            if (xx >= 0 && yy >= 0 && xx < n && yy < m && p[xx][yy] == '.' && !vis[xx][yy]) {
                vis[xx][yy] = 1;
                sum++;
                q.push({xx, yy});
            }
        }
    }
    return sum;
}

int main()
{
    while (cin >> m >> n && n + m) {
        for (int i = 0; i < n; i++) {
            cin >> p[i];
            for (int j = 0; j < m; j++) {
                if (p[i][j] == '@') sx = i, sy = j;
            }
        }
        cout << bfs() << endl;
    }
    return 0;
}