nyoj 游戏高手的烦恼 (二分图最小点覆盖)

还是想半天都没想明白。。 做得不多不熟，所以也联系不起来。

二分图最小点覆盖= 二分图的匹配数  详细请看某周的hihocoder

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<cmath>
#include<stdlib.h>
#include<vector>
#include<set>
#define INF 1e7
#define MAXN 100010
#define maxn 50
#define maxm 1000
#define Mod 1000007
using namespace std;
typedef long long LL;


int T;
int u, v;
int n, m;
int ans;
vector<int> G[555];
int vis[10010];
int match[10010];

bool path(int u)
{
    for (int i = 0; i < G[u].size(); ++i) {
        int v = G[u][i];
        if (true == vis[v]) continue;
        vis[v] = true;
        if (match[v] == -1 || path(match[v])) {
            match[v] = u;
            return true;
        }
    }
    return false;
}

void hungarian()
{
    ans = 0;
    memset(match,-1,sizeof(match));
    for (int i = 1; i <= n; ++i) {
        memset(vis,0,sizeof(vis));
        if (path(i)) ans++;
    }
}

void run()
{
    scanf("%d%d",&n,&m);
    for (int i = 0; i <= n; ++i) {
        G[i].clear();
    }
    for (int i = 0; i < m; ++i) {
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
    }
    hungarian();
    printf("%d
",ans);
    
}
int main()
{
    scanf("%d", &T);
    while (T--)
        run();
    return 0;
}