HDU 1151 Air Raid( 最小路径覆盖)

#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<set>
#include<stack>
#define cl(a,b) memset(a,b,sizeof(a));
#define LL long long
#define P pair<int,int>
#define X first
#define Y second
#define pb push_back
using namespace std;
const int maxn=250;
const int inf=9999999;
const int mod=100007;
vector<int> G[maxn];
int num_left;
int matching[maxn];
bool vis[maxn];
bool dfs(int u){
    int N=G[u].size();
    for(int i=0;i<N;i++){
        int v=G[u][i];
        if(vis[v])continue;
        vis[v]=true;
        if(matching[v]==-1||dfs(matching[v])){
            matching[v]=u;
            return true;
        }
    }
    return false;
}
int hungar(){
    int ans=0;
    cl(matching,-1);
    for(int i=0;i<num_left;i++){
        cl(vis,false);
        if(dfs(i))ans++;
    }
    return num_left-ans;
}

int main(){
    int T;
    scanf("%d",&T);
    while(T--){

        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=0;i<=n;i++)G[i].clear();
        for(int i=0;i<m;i++){
            int u,v;
            scanf("%d%d",&u,&v);
            --u;--v;
            G[u].pb(v);//本题是有向图，只要一边
        }
        num_left=n;
        printf("%d\n",hungar());
    }
    return 0;
}