HDU 4185 Oil Skimming （二分图匹配）

题意：给定一张n*n的图，求不重复的两个相邻“#”有多少组。

题解：二分图匹配
对于点“#”进行编号，遍历的时候若当前字符是“#”，与它上下左右是“#”的建边，由于是无向图，跑出的最大匹配 / 2就是答案。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
const int MAXN = 610;
int uN, vN;//u,v 的数目，使用前面必须赋值
int g[MAXN][MAXN];//邻接矩阵
int linker[MAXN];
bool used[MAXN];
bool dfs(int u) {
    for (int v = 1; v <= vN; v++)
        if (g[u][v] && !used[v]) {
            used[v] = true;
            if (linker[v] == -1 || dfs(linker[v])) {
                linker[v] = u;
                return true;
            }
        }
    return false;
}
int hungary() {
    int res = 0;
    memset(linker, -1, sizeof(linker));
    for (int u = 1; u <= uN; u++) {
        memset(used, false, sizeof(used));
        if (dfs(u))res++;
    }
    return res;
}
int t, n, id[MAXN][MAXN];
char s[MAXN];
int main() {
    scanf("%d", &t);
    int cas = 0;
    while (t--) {
        memset(id, 0, sizeof(id));
        memset(g, 0, sizeof(g));
        scanf("%d", &n);
        int tot = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%s", s + 1);
            for (int j = 1; j <= n; j++) {
                if (s[j] == '#') id[i][j] = ++tot;
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (!id[i][j]) continue;
                if (i - 1 >= 1 && id[i - 1][j]) g[id[i][j]][id[i - 1][j]] = 1;
                if (i + 1 <= n && id[i + 1][j]) g[id[i][j]][id[i + 1][j]] = 1;
                if (j - 1 >= 1 && id[i][j - 1]) g[id[i][j]][id[i][j - 1]] = 1;
                if (j + 1 <= n && id[i][j + 1]) g[id[i][j]][id[i][j + 1]] = 1;
            }
        }
        uN = vN = tot;
        printf("Case %d: %d\n", ++cas, hungary() / 2);
    }
	return 0;
}