POJ 3041 Asteroids | 匈牙利算法模板

emmmmm

让你敲个匈牙利

 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #define N 510
 using namespace std;
 int adj[N][N],n,k,vis[N],bf[N],cnt;
 int find(int x)
 {
     for (int i=;i<=n;i++)
     if (adj[x][i] && !vis[i])
     {
         vis[i]=;
         if (!bf[i] || find(bf[i]))
         {
         return bf[i]=x;
         }
     }
     return ;
 }
 int main()
 {
     scanf("%d%d",&n,&k);
     for (int i=,x,y;i<=k;i++)
     {
     scanf("%d%d",&x,&y);
     adj[x][y]=;
     }
     for (int i=;i<=n;i++)
     {
     memset(vis,,sizeof(vis));
     if (find(i)) cnt++;
     }
     printf("%d",cnt);
     return ;
 }