poj1422

点击打开链接

继续膜大神，套模板= =

好歹还是分清楚最大独立集，最小点覆盖，最小路径覆盖= =

虽然前两者还木有实践= =但感觉这类题目只是模板型弱鸡= =

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

const int N = 1005;

int t, m, n;
vector<int> g[N];
int left[N], vis[N];

bool dfs(int u) {
    for (int i = 0; i < g[u].size(); i++) {
        int v = g[u][i];
        if (vis[v]) continue;
        vis[v] = 1;
        if (!left[v] || dfs(left[v])) {
            left[v] = u;
            return true;
        }
    }
    return false;
}

int  hungary() {
    int ans = 0;
    memset(left, 0, sizeof(left));
    for (int i = 1; i <= n; i++) {
        memset(vis, 0, sizeof(vis));
        if (dfs(i)) ans++;
    }
    return ans;
}

int main(){
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
            g[i].clear();
        for(int i=0;i<m;i++){
            int a,b;
            scanf("%d%d",&a,&b);
            g[a].push_back(b);
        }
        printf("%d\n",n-hungary());
    }
    return 0;
}