ZOJ 3933 Team Formation （km算法）

题意：两个队伍，有一些边相连，问最大组对数以及最多女生数量

分析：可以转化成最大权匹配问题，男男权为2，男女为3，女女为4，直接调用km算法，不过要注意km算法恒要求nx<=ny，这里我t了好长时间。。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <queue>
#include <map>
#include <stack>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 1000010
#define MOD 1000000007

char s1[550],s2[550];
int nx,ny,ans1,ans2,a[550],b[550],n;
int linker[550],lx[550],ly[550],slack[550];
int g[550][550],visx[550],visy[550];
int dfs(int x)
{
    visx[x] = 1;
    for(int y = 0; y < ny; y++)
    {
        if(visy[y] || !g[a[x]][b[y]])
            continue;
        int tmp = lx[x] + ly[y] - g[a[x]][b[y]];
        if(tmp == 0)
        {
            visy[y] = 1;
            if(linker[y] == -1 || dfs(linker[y]))
            {
                linker[y] = x;
                return 1;
            }
        }
        else if(slack[y] > tmp)
            slack[y] = tmp;
    }
    return 0;
}
int KM()
{
    memset(linker,-1,sizeof(linker));
    memset(ly,0,sizeof(ly));
    for(int i = 0; i < nx; i++)
    {
        lx[i] = -INF;
        for(int j = 0; j < ny; j++)
            if(g[a[i]][b[j]] > lx[i])
                lx[i] = g[a[i]][b[j]];
    }
    for(int x = 0; x < nx; x++)
    {
        for(int i = 0; i < ny; i++)
            slack[i] = INF;
        while(1)
        {
            memset(visx,0,sizeof(visx));
            memset(visy,0,sizeof(visy));
            if(dfs(x))
                break;
            int d = INF;
            for(int i = 0; i < ny; i++)
                if(!visy[i] && d > slack[i])
                    d = slack[i];
            for(int i = 0; i < nx; i++)
                if(visx[i])
                    lx[i] -= d;
            for(int i = 0; i < ny; i++)
            {
                if(visy[i])
                    ly[i] += d;
                else
                    slack[i] -= d;
            }
        }
    }
    int res = 0;
    for(int i = 0; i < ny; i++)
        if(linker[i] != -1)
            res++;
    return res;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int x;
        nx = 0,ny = 0;
        scanf("%d%s%s",&n,s1,s2);
        memset(g,-1,sizeof(g));
        for(int i = 0; i < n; i++)
        {
            if(s1[i] == '0')
                a[nx++] = i;
            else
                b[ny++] = i;
        }
        if(nx > ny)
        {
            swap(nx,ny);
            for(int i = 0; i < ny; i++)
                swap(a[i],b[i]);
        }
        for(int i = 0; i < n; i++)
        {
            scanf("%d",&x);
            for(int j = 0; j < x; j++)
            {
                int y;
                scanf("%d",&y);
                g[i][y-1] = 0;
            }
        }
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++)
        {
            if(i == j || !g[i][j])
                continue;
            if(s1[i] == s1[j])
            {
                g[i][j] = 0;
                continue;
            }
            if(s2[i] == '0')
            {
                if(s2[j] == '0')
                    g[i][j] = 4;
                else
                    g[i][j] = 3;
            }
            else
            {
                if(s2[j] == '0')
                    g[i][j] = 3;
                else
                    g[i][j] = 2;
            }
        }
        ans1 = KM();
        ans2 = 0;
        for(int i = 0; i < ny; i++)
            if(linker[i] != -1)
        {
            if(s2[b[i]] == '0')
                ans2++;
            if(s2[a[linker[i]]] == '0')
                ans2++;
        }
        printf("%d %d\n",ans1,ans2);
        for(int i = 0; i < ny; i++)
            if(linker[i] != -1)
              printf("%d %d\n",b[i]+1,a[linker[i]]+1);
    }
    return 0;
}