zoj 1654 Place the Robots

类型：二分图

题目：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=654

来源： ZOJ Monthly, October 2003

思路：将空位看做边，行列看做点。如果行中间有墙，则行可以划分为多个“行”，使得两两之间不会相互攻击。由于每条边表示一个空地，有冲突的空地之间必有公共顶点。所以结果即是求新构造二分图的最大匹配数

！！！构造新图的点的范围 50 * 50

// zoj 1654 Place the Robots
// sf sf sf sf ac 70ms 9164kb
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define FOR(i,a,b) for(i = (a); i < (b); ++i)
#define FORE(i,a,b) for(i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(i = (a); i > (b); --i)
#define FORDE(i,a,b) for(i = (a); i >= (b); --i)
#define CLR(a,b) memset(a,b,sizeof(a))
#define PB(x) push_back(x)

const int MAXN = 55;

bool g[MAXN * MAXN][MAXN * MAXN];
int n, m, t;
int cntx, cnty, ans, cas = 1;
int posx[MAXN][MAXN], posy[MAXN][MAXN];
int result[MAXN * MAXN];
bool state [MAXN * MAXN];
char tu[MAXN][MAXN];

void create() {
    int i, j, l;

    FOR(i, 0, n) {
        j = 0;
        while(j < m) {
            if(tu[i][j] == 'o') {
                ++cntx;
                while(j < m && tu[i][j] != '#')
                    posx[i][j++] = cntx;
            }
            else
                ++j;
        }
    }
    FOR(j, 0, m) {
        i = 0;
        while(i < n) {
            if(tu[i][j] == 'o') {
                ++cnty;
                while(i < n && tu[i][j] != '#')
                    posy[i++][j] = cnty;
            }
            else
                ++i;
        }
    }
    FOR(i, 0, n) FOR(j, 0, m) if(tu[i][j] == 'o')
        g[posx[i][j]][posy[i][j]] = true;
}

void init() {
    int i;

    CLR(g, false);
    CLR(posx, 0);
    CLR(posy, 0);
    CLR(result, 0);
    ans = cntx = cnty = 0;
    scanf("%d %d", &n, &m);
    FOR(i, 0, n)
        scanf("%s", tu[i]);
}

bool find(int a) {
    int i;

    FORE(i, 1, cnty) {
        if (g[a][i] && !state[i]) {
            state[i] = true;
            if (result[i] == 0 || find(result[i])) {
                result[i] = a;
                return true;
            }
        }
    }
    return false;
}

void solve() {
    int i;

    create();
    FORE(i, 1, cntx) {
        CLR(state, false);
        if (find(i))
            ++ans;
    }
    printf("Case :%d\n", cas++);
    printf("%d\n", ans);
}

int main() {
    scanf("%d", &t);
    while(t--) {
        init();
        solve();
    }
    return 0;
}