POJ3020 Antenna Placement 二分匹配 || 一般图匹配

题目：

http://poj.org/problem?id=3020

题意：

给定一个n*m的矩阵，矩阵中有‘’和‘o’两种元素，每次可以覆盖一个或者两个相邻的‘’（上下左右四个方向相邻），问最少多少次可以覆盖所有的‘*’

思路

二分匹配：
把每个‘’拆成两个点，相邻的‘’进行连边，可以转换为二分图的最小边覆盖问题，注意这里每个点拆成了两个点！！！
一般图匹配：
每个‘’视作一个点，相邻的‘’直接连边，然后用带花树开花算法跑出匹配即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int N = 510;
struct edge
{
    int to, next;
} g[N*N];
int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
int head[N], match[N];
int nx, ny, cnt, cas = 0;
bool used[N];
void add_edge(int v, int u)
{
    g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
bool dfs(int v)
{
    for(int i = head[v]; i != -1; i = g[i].next)
    {
        int u = g[i].to;
        if(! used[u])
        {
            used[u] = true;
            if(match[u] == -1 || dfs(match[u]))
            {
                match[u] = v;
                return true;
            }
        }
    }
    return false;
}
int hungary()
{
    int res = 0;
    memset(match, -1, sizeof match);
    for(int i = 1; i <= nx; i++)
    {
        memset(used, 0, sizeof used);
        if(dfs(i)) res++;
    }
    return res;
}
char mpa[50][50];
int id[50][50];
int main()
{
    int t, n, m;

    scanf("%d", &t);
    while(t--)
    {
        cnt = 0;
        memset(head, -1, sizeof head);
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; i++)
            scanf(" %s", mpa[i] + 1);
        memset(id, 0, sizeof id);
        int num = 0;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                if(mpa[i][j] == '*') id[i][j] = ++num;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                if(id[i][j])
                {
                    for(int k = 0; k < 4; k++)
                    {
                        int nx = i + dx[k], ny = j + dy[k];
                        if(nx >= 1 && nx <= n && ny >= 1 && ny <= m && id[nx][ny])
                            add_edge(id[i][j], id[nx][ny]);
                    }
                }
        nx = ny = num;
        int ans = hungary();
        printf("%d\n", num - ans + ans / 2);
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int N = 410;

struct edge
{
    int to, next;
}g[N*N*2];

int cnt, head[N];
int que[N], rear;
int match[N], mark[N], nxt[N], par[N], vis[N];
int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
int idx[50][50];
char s[50][50];


void add_edge(int v, int u)
{
    g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
int ser(int x)
{
    int r = x, i = x, j;
    while(r != par[r]) r = par[r];
    while(i != r) j = par[i], par[i] = r, i = j;
    return r;
}
void unite(int x, int y)
{
    x = ser(x), y = ser(y);
    if(x == y) return;
    par[x] = y;
}
int lca(int x, int y)
{
    static int t = 0;
    t++;
    while(true)
    {
        if(x != -1)
        {
            x = ser(x); //点要对应到所在的花上去
            if(vis[x] == t) return x;
            vis[x] = t;
            if(match[x] != -1) x = nxt[match[x]];
            else x = -1;
        }
        swap(x, y); //交换，使两点轮流走
    }
}
void group(int x, int r)
{
    while(x != r)
    {
        int y = match[x], z = nxt[y];
        if(ser(z) != r) nxt[z] = y;
        if(mark[y] == 2) mark[que[rear++] = y] = 1;
        if(mark[z] == 2) mark[que[rear++] = z] = 1;
        unite(x, y), unite(y, z);
        x = z;
    }
}
void augmented(int n, int s)
{
    for(int i = 1; i <= n; i++)
        nxt[i] = -1, par[i] = i, mark[i] = 0, vis[i] = -1;
    mark[s] = 1;
    que[0] = s;
    rear = 1;
    for(int i = 0; match[s] == -1 && i < rear; i++)
    {
        int v = que[i];
        for(int j = head[v]; j != -1; j = g[j].next)
        {
            int u = g[j].to;
            if(match[v] == u) continue; //v,u已经匹配，跳过
            if(ser(v) == ser(u)) continue; //在同一朵花中，跳过
            if(mark[u] == 2) continue; //T型，跳过
            if(mark[u] == 1) //S型，奇环缩点
            {
                int r = lca(v, u); // r为从v和u到s的路径上的第一个公共节点
                if(ser(v) != r) nxt[v] = u; // r和v不在同一个花朵，nxt标记花朵内路径
                if(ser(u) != r) nxt[u] = v; // r和u不在同一个花朵，nxt标记花朵内路径
                //将整个r-x-y-r的奇环缩成点，r作为这个环的标记节点
                group(v, r), group(u, r);// 缩路径r-v和r-u为点
            }
            else if(match[u] == -1) //u自由，可以增广
            {
                nxt[u] = v;
                for(int k = u; k != -1;) //交错路取反
                {
                    int x = nxt[k];
                    int tm = match[x];
                    match[x] = k, match[k] = x;
                    k = tm;
                }
                break; // 搜索成功，退出循环将进入下一阶段
            }
            else
            { // 当前搜索的交叉链+u+match[u]形成新的交错路，将match[u]加入队列作为待搜节点
                nxt[u] = v;
                mark[que[rear++] = match[u]] = 1;
                mark[u] = 2;
            }
        }
    }
}
int work(int n)
{
    memset(match, -1, sizeof match);
    for(int i = 1; i <= n; i++)
        if(match[i] == -1) augmented(n, i);
    int num = 0;
    for(int i = 1; i <= n; i++)
        if(match[i] != -1) num++;
    return num/2;
}
int main()
{
    int t, n, m;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d", &n, &m);
        for(int i = 0; i < n; i++) scanf(" %s", s[i]);
        int num = 0;
        memset(idx, 0, sizeof idx);
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
                if(s[i][j] == '*') idx[i][j] = ++num;
        cnt = 0;
        memset(head, -1, sizeof head);
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
                if(idx[i][j])
                {
                    for(int k = 0; k < 4; k++)
                    {
                        int nx = i + dx[k], ny = j + dy[k];
                        if(nx >= 0 && nx < n && ny >= 0 && ny < m && idx[nx][ny])
                            add_edge(idx[i][j], idx[nx][ny]);
                    }
                }
        int res = work(num);
        //cout << num << " " << res << endl;
        printf("%d\n", num - res*2 + res);
    }
    return 0;
}