hdu 5093 Battle ships 经典二分匹配模型

建模参考：点击打开链接

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<set>
#include<vector>
#include<map>

using namespace std;

#define N 55
#define M 2505

struct node{
    int to, nxt;
}edge[M*2];

int head[M];
int cnt;
int n, m;
char a[N][N];
int link[M];
int vis[M];
int r[N][N], l[N][N];
int x, y;

void init()
{
    cnt = 1;
    memset(head, -1, sizeof(head));
    memset(r, 0, sizeof(r));
    memset(l, 0, sizeof(l));
}

void addedge( int u, int v )
{
    edge[cnt].to = v;
    edge[cnt].nxt = head[u];
    head[u] = cnt++;
}

int find( int u )
{
    for (int i = head[u]; ~i; i = edge[i].nxt )
    {
        int v = edge[i].to;
        //printf("%d -> %d\n", u, v);
        if( !vis[v] )
        {
            vis[v] = 1;
            if( link[v] == -1 || find(link[v]) )
            {
                link[v] = u;
                return 1;
            }
        }
    }
    return 0;
}

int maxmatch()
{
    int res = 0;
    memset(link, 0, sizeof( link));
    memset(link, -1, sizeof(link));
    for( int i = 1; i < x; i++ )
    {
        memset( vis, 0, sizeof( vis ));
        res += find(i);
    }
    return res;
}

int main()
{
    int tot;
    for( scanf("%d", &tot); tot--; )
    {
        scanf("%d%d", &n, &m);
        for ( int i = 1; i <= n; i ++ )
        {
            scanf("%s", a[i] + 1);
        }
        init();
        x = 1;
        for( int i = 1; i <= n; i ++ )
        {
            bool f = 0;
            for( int j = 1; j <= m; j++ )
            {
                if( a[i][j] == '*' )
                {
                    f = 1;
                    r[i][j] = x;
                }
                if( a[i][j] == '#' )
                {
                    x++;
                    f = 0;
                }
            }
            if( f )
                x++;
        }
        y = 1;
        for( int j = 1; j <= m; j ++ )
        {
            bool f = 0;
            for( int i = 1; i <= n; i++ )
            {
                if( a[i][j] == '*' )
                {
                    f = 1;
                    l[i][j] = y;
                }
                else if( a[i][j] == '#' )
                {
                    y++;
                    f = 0;
                }
            }
            if( f )
                y++;
        }
        for ( int i = 1; i <= n; i ++ )
        {
            for ( int j = 1; j <= m; j++ )
            {
                if( a[i][j] == '*' )
                {
                    addedge(r[i][j], l[i][j]);
                    //printf("%d %d\n", r[i][j], l[i][j]);
                }
            }
        }
        /*for ( int i = 1; i <= n; i ++ )
        {
            for ( int j = 1; j <= m; j++ )
            {
                printf("%d ", r[i][j]);
            }
            puts("");
        }
        puts("");
        for ( int j = 1; j <= m; j ++ )
        {
            for ( int i = 1; i <= n; i++ )
            {
                printf("%d ", l[i][j]);
            }
            puts("");
        }*/
        int ans = maxmatch();
        printf("%d\n", ans);
    }
    return 0;
}