匈牙利算法模板&nyoj239

#include <bits/stdc++.h>
using namespace std;
vector<int> v[510];
int match[510];
int check[510];
int n, k;
int dfs(int x)
{
    for(int i = 0; i < v[x].size(); i++)
    {
        int t = v[x][i];
        if (check[t] == 0)
        {
            check[t] = 1;
            if(match[t] == 0 || dfs(match[t]))
            {
                match[t] = x;
                return 1;
            }
        }
    }
    return 0;
}
void init()
{
    for(int i = 0; i <= n; i++)
        v[i].clear();
    memset(match, 0, sizeof(match));
}
int hungarian()
{
    int sum = 0;
    for(int i = 1; i <= n; i++)
    {
        memset(check, 0, sizeof(check));
        if(dfs(i))
            sum++;
    }
    return sum;
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        init();
        scanf("%d%d", &n, &k);
        int s, e;
        for(int i = 0; i < k; i++)
        {
            scanf("%d%d", &s, &e);
            v[s].push_back(e);
        }
        printf("%d
", hungarian());
    }
}