POJ1979: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)
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).

原题链接: https://cn.vjudge.net/problem/POJ-1979

题解

简单搜索题，直接bfs就行

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <cstring>

using namespace std;
const int MAX_N = 20 + 1;
const int dir[4][2] = {0, -1, 1, 0, 0, 1, -1, 0};
char M[MAX_N][MAX_N];
bool vis[MAX_N][MAX_N];
int W, H;
int startx, starty;
struct node {
    int x, y;
};

void solve() {
    int sum = 0;

    memset(vis, 0, sizeof(vis));
    queue<node> Q;
    Q.push(node{startx, starty});
    vis[startx][starty] = true;

    while (!Q.empty()) {
        node p = Q.front();
        Q.pop();
        sum++;
        for (int i = 0; i < 4; i++) {
            int tox = p.x + dir[i][0], toy = p.y + dir[i][1];
            if (tox >= 0 && tox < W && toy >= 0 && toy < H && !vis[tox][toy]) {
                if (M[toy][tox] == '.') {
                    vis[tox][toy] = true;
                    Q.push(node{tox, toy});
                }
            }
        }
    }

    printf("%d\n", sum);
}


int main() {
    while (~scanf("%d %d", &W, &H) && W && H) {
        getchar();
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                scanf("%c", &M[i][j]);
                if (M[i][j] == '@') {
                    startx = j;
                    starty = i;
                }
            }
            getchar();
        }
        solve();
    }
    return 0;
}