poj 3041 二分匹配

//把小行星的x和y坐标匹配
#include <iostream>
#include <cstring>
using namespace std;
#define MAXN 501

int N,K;
int G[MAXN][MAXN];
int cx[MAXN],cy[MAXN];
int sx[MAXN],sy[MAXN];

int path(int u)
{
  sx[u] = 1;
  for(int v = 1; v <= N; v++)
    {
      if(G[u][v] > 0 && (!sy[v]) )
	{
	  sy[v] = 1;
	  if(!cy[v] || path(cy[v]))
	    {
	      cx[u] = v;
	      cy[v] = u;
	      return 1;
	    }
	}
    }
  return 0;
}

int MaxMatch()
{
  int res = 0;
  memset(cx,0,sizeof(cx));
  memset(cy,0,sizeof(cy));
  for(int i = 1; i <= N; i++)
    {
      if(! cx[i])
	{
	  memset(sx,0,sizeof(sx));
	  memset(sy,0,sizeof(sy));
	  res += path(i);
	}
    }
  return res;
}

int main()
{
  while(cin>>N>>K)
    {
      int x,y;
      for(int i = 0; i < K; i++)
	{
	  cin>>x>>y;
	  G[x][y] = 1;
	}
      cout<<MaxMatch()<<endl;
    }
  return 0;
}