POJ 3057 Evacuation——二分图匹配

思路挺巧妙，推荐看一下挑战程序设计P233，额。。。写的时候vis数组和used数组搞混了，最近怎么总是犯这种错误。。。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
int T, n, m;
char G[15][15];
int cnt1, d[15][15], cnt2, p[15][15];
int dis[255][255];
bool vis[15][15];
struct State {
    int x, y, d;
    State(int a, int b, int c):x(a), y(b), d(c){}
};
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
void bfs(int x, int y, int id) {
    memset(vis, false, sizeof(vis));
    queue<State> q;
    q.push(State(x, y, 0));
    while (!q.empty()) {
        State cur = q.front(); q.pop();
        for (int i = 0; i < 4; i++) {
            int xx = dx[i] + cur.x, yy = dy[i] + cur.y;
            if (0 <= xx && xx < n && 0 <= yy && yy < m && G[xx][yy] == '.' && !vis[xx][yy]) {
                vis[xx][yy] = true;
                q.push(State(xx, yy, cur.d+1));
                dis[id][p[xx][yy]] = cur.d+1;
            }
        }
    }
}
vector<int> g[55000];
int match[55000];
bool used[55000];
void addedge(int u, int v) {
    g[u].push_back(v);
    g[v].push_back(u);
}
bool dfs(int u) {
    used[u] = true;
    for (int i = 0; i < g[u].size(); i++) {
        int v = g[u][i];
        if (match[v] < 0 || (!used[match[v]] && dfs(match[v]))) {
            match[v] = u;
            return true;
        }
    }
    return false;
}
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d %d", &n, &m);
        getchar();
        for (int i = 0; i < n; i++) gets(G[i]);
        cnt1 = cnt2 = 0;
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (G[i][j] == 'D') d[i][j] = cnt1++;
                else if (G[i][j] == '.') p[i][j] = cnt2++;
            }
        }
        if (cnt2 == 0) { printf("0\n"); continue; }
        memset(dis, 0, sizeof(dis));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (G[i][j] == 'D') bfs(i, j, d[i][j]);
            }
        }
        for (int i = 0; i <= cnt2+n*m*cnt1+10; i++) g[i].clear();
        for (int i = 0; i < cnt1; i++) {
            for (int j = 0; j < cnt2; j++) {
                if (dis[i][j] == 0) continue;
                for (int k = dis[i][j]; k <= n*m; k++) {
                    addedge((k-1)*cnt1+i, n*m*cnt1+j);
                }
            }
        }
        bool ok = true;
        int num = 0;
        memset(match, -1, sizeof(match));
        for (int i = 0; i < n*m*cnt1; i++) {
            memset(used, false, sizeof(used));
            if (dfs(i)) {
                if (++num == cnt2) {
                    printf("%d\n", i / cnt1 + 1);
                    ok = false;
                    break;
                }
            }
        }
        if (ok) printf("impossible\n");
    }
    return 0;
}