HDU-1241-Oil Deposits

#include <iostream>
#include <memory.h>
#include <vector>
#include <map>
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <queue>
#include <string>

using namespace std;

typedef long long LL;

const int MAXN = 100 + 10;

int Next[8][2] = {{-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}};
char Map[MAXN][MAXN];
int n, m;

void BFS(int x, int y)
{
    queue<pair<int, int> > que;
    que.emplace(x, y);
    while (!que.empty())
    {
        for (int i = 0;i < 8;i++)
        {
            int tx = que.front().first + Next[i][0];
            int ty = que.front().second + Next[i][1];
            if (tx < 1 || tx > n || ty < 1 || ty > m)
                continue;
            if (Map[tx][ty] == ‘*‘)
                continue;
            que.emplace(tx, ty);
            Map[tx][ty] = ‘*‘;
        }
        que.pop();
    }
}

int main()
{
    while (cin >> n >> m)
    {
        if (n == 0 && m == 0)
            break;
        for (int i = 1;i <= n;i++)
            for (int j = 1;j <= m;j++)
                cin >> Map[i][j];
        int res = 0;
        for (int i = 1;i <= n;i++)
            for (int j = 1;j <= m;j++)
            {
                if (Map[i][j] == ‘@‘)
                    res++, BFS(i, j);
            }
        cout << res << endl;
    }

    return 0;
}