hdu 2531 整块bfs

题意：

给一个不超过20的整块，移动走迷宫。

http://acm.hdu.edu.cn/showproblem.php?pid=2531

解析：

把整个块当做一个点，然后移动判断。

详见代码。

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#define LL long long
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1

using namespace std;
const int maxn = 100 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
const double pi = acos(-1.0);
const double ee = exp(1.0);

int dir[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int n, m;
int sx, sy;
char g[maxn][maxn];

struct Node
{
    int x[30], y[30];
} start;
int step[maxn][maxn];
int cnt;

bool catched(Node now)
{
    for (int i = 0; i < cnt; i++)
    {
        if (g[now.x[i]][now.y[i]] == 'Q')
            return true;
    }
    return false;
}

Node mov(Node now, int dx, int dy)
{
    for (int i = 0; i < cnt; i++)
    {
        now.x[i] += dx;
        now.y[i] += dy;
    }
    return now;
}

bool ok(Node now)
{
    for (int i = 0; i < cnt; i++)
    {
        if (now.x[i] < 0 || n <= now.x[i] || now.y[i] < 0 || m <= now.y[i] || g[now.x[i]][now.y[i]] == 'O')
            return false;
    }
    return true;
}

int bfs()
{
    memset(step, -1, sizeof(step));
    queue<Node> q;
    q.push(start);
    step[start.x[0]][start.y[0]] = 0;

    while (!q.empty())
    {
        Node now = q.front();
        q.pop();

        if (catched(now))
        {
            return step[now.x[0]][now.y[0]];
        }
        for (int i = 0; i < 4; i++)
        {
            Node next = mov(now, dir[i][0], dir[i][1]);
            if (ok(next))
            {
                if (step[next.x[0]][next.y[0]] == -1)
                {
                    step[next.x[0]][next.y[0]] = step[now.x[0]][now.y[0]] + 1;
                    q.push(next);
                }
            }
        }
    }
    return -1;
}

int main()
{
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
#endif // LOCAL
    while (~scanf("%d%d", &n, &m))
    {
        if (!n && !m)
            break;
        cnt = 0;
        for (int i = 0; i < n; i++)
        {
            scanf("%s", g[i]);
            for (int j = 0; j < m; j++)
            {
                if (g[i][j] == 'D')
                {
                    start.x[cnt] = i;
                    start.y[cnt++] = j;
                }
            }
        }
        int ans = bfs();
        if (ans == -1)
            printf("Impossible\n");
        else
            printf("%d\n", ans);
    }
    return 0;
}