ZOJ 3933 Team Formation（KM最大权）

https://vjudge.net/contest/293912#problem/G

最大权匹配简单题，

刚学最大权不太熟悉导致不太会用，。

这道题把男生点权设为0，女生设为1，初始边权设为1就能做了

KM只对有权值的边进行匹配，所以如果边权为0无法控制

最后计算的时候再减去配对成功数目即可

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 505;
int n;
int nx, ny;//两边的点数
int g[maxn][maxn];
int link[maxn], lx[maxn], ly[maxn]; // y中各店匹配状态， x，y中的点标号
bool visx[maxn], visy[maxn];
int slack[maxn];//被匹配者被匹配上需要的最小期望值
bool dfs(int x)
{
    visx[x] = 1;
    for(int y = 1; y <= ny; y ++)
    {
        if(visy[y]) continue;
        int tmp = lx[x] + ly[y] - g[x][y];
        if(tmp == 0)
        {
            visy[y] = 1;
            if(link[y] == -1 || dfs(link[y]))
            {
                link[y] = x;
                return 1;
            }
        }
        else if(slack[y] > tmp)
            slack[y] = tmp;
    }
    return 0;
}
int km()
{
    memset(link, -1, sizeof(link));
    memset(ly, 0, sizeof(ly));
    for(int i = 1; i <= nx; i ++)
    {
        lx[i] = - inf;
        for(int j = 1; j <= ny; j ++)
        {
            if(g[i][j] > lx[i])
                lx[i] = g[i][j];
        }
    }
    for(int x = 1; x <= nx; x ++)
    {
        for(int i = 1; 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 = 1; i <= ny; i ++)
                if(! visy[i] && d > slack[i])
                d = slack[i];
            for(int i = 1; i <= nx; i ++)
                if(visx[i])
                    lx[i] -= d;
            for(int i = 1; i <= ny; i ++)
                if(visy[i]) ly[i] += d;
                else slack[i] -= d;
        }
    }
    int ans = 0;
    for(int i = 1; i <= ny; i ++)
        if(link[i] != -1)
            ans += g[link[i]][i];
    return ans;
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t --)
    {
        char a[505];
        memset(g, 0, sizeof(g));
        scanf("%d", &n);
        scanf("%s", a + 1);
        nx = n, ny = n;
        char b[505];
        bool vis[505][505];
        scanf("%s", b + 1);
        memset(vis, 0, sizeof(vis));
        for(int i = 1; i <= n; i ++)
        {
            int tmp;
            scanf("%d", &tmp);
            while(tmp --)
            {
                int k;
                scanf("%d", &k);
                vis[i][k] = vis[k][i] = 1;
            }
        }
        for(int i = 1; i <= n; i ++)
        {
            for(int j = 1; j <= n; j ++)
            {
                if(! vis[i][j] && a[i] != a[j])
                {
                    int tmp = 1;
                    if(b[i] == '0') tmp ++;
                    if(b[j] == '0') tmp ++;
                    vis[i][j] = vis[j][i] = 1;
                    if(a[i] == '1') g[i][j] = tmp;//确定方向唯一性
                    else g[j][i] = tmp;
                }
            }
        }
        int ans = km();
        int num = 0;
        for(int i = 1; i <= n; i ++)
            if(link[i] != -1 && g[link[i]][i])
                num ++;
        printf("%d %d\n", num, ans - num);
        for(int i = 1; i <= n; i ++)
        {
            if(link[i] != -1 && g[link[i]][i])
                printf("%d %d\n", link[i], i);
        }
    }
    return 0;
}