HDU1198

别人都用的dfs，并查集
我用的bfs也过了

#include<iostream>
#include<algorithm>
#include<queue>
#include<functional>
#include<vector>
#include<string>
#include<cstdlib>
#include<stack>
using namespace std;
int zujian[11][4] = {
    { 1,0,0,1 },
    { 1,1,0,0 },
    { 0,0,1,1 },
    { 0,1,1,0 },
    { 1,0,1,0 },
    { 0,1,0,1 },
    { 1,1,0,1 },
    { 1,0,1,1 },
    { 0,1,1,1 },
    { 1,1,1,0 },
    { 1,1,1,1 }
};
int n, m;
int map[550][550];
int book[550][550];
int yidong[4][2] = { { 0,1 },{ 1,0 },{ -1,0 },{ 0,-1 } };
struct p
{
    int x, y;
};
void bfs(int a, int b)
{
    stack<p> s;
    s.push({ a,b });
    while (!s.empty())
    {
        p u = s.top();
        s.pop();
        book[u.x][u.y] = 1;
        for (int c = 0;c < 4;c++)
        {
            int x = u.x + yidong[c][0];
            int y = u.y + yidong[c][1];
            if (x >= 0 && y >= 0 && x < m&&y < n)
            {
                if (x < u.x)
                {
                    if (zujian[map[u.x][u.y]][0] == 1 && zujian[map[x][y]][2] == 1 && book[x][y] == 0)
                    {
                        s.push({ x,y });
                        book[x][y] = 1;
                    }
                }
                else if (x>u.x)
                {
                    if (zujian[map[u.x][u.y]][2] == 1 && zujian[map[x][y]][0] == 1 && book[x][y] == 0)
                    {
                        s.push({ x,y });
                        book[x][y] = 1;
                    }
                }
                else if (y < u.y)
                {
                    if (zujian[map[u.x][u.y]][3] == 1 && zujian[map[x][y]][1] == 1 && book[x][y] == 0)
                    {
                        s.push({ x,y });
                        book[x][y] = 1;
                    }
                }
                else if (y>u.y)
                {
                    if (zujian[map[u.x][u.y]][1] == 1 && zujian[map[x][y]][3] == 1 && book[x][y] == 0)
                    {
                        s.push({ x,y });
                        book[x][y] = 1;
                    }
                }
            }
        }
    }
}
int main()
{
    while (cin >> m >> n)
    {
        if (n == -1 && m == -1)break;
        memset(book, 0, sizeof(book));
        for (int a = 0;a < m;a++)
        {
            string b;
            cin >> b;
            for (int c = 0;c < n;c++)map[a][c] = b[c] - 'A';
        }
        int sum = 0;
        for (int a = 0;a < m;a++)
        {
            for (int b = 0;b < n;b++)
            {
                if (book[a][b] == 0)
                {
                    sum++;
                    bfs(a, b);
                }
            }
        }
        cout << sum  << endl;
    }
    return 0;
}