题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2063
思路:就是匈牙利模板
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <unordered_map>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int g[508][508],cy[508],cx[508],k,n,m;
bool vis[508];
bool dfs(int u)
{
FOR(i,1,m)
{
if(g[u][i]&&!vis[i])
{
vis[i]=1;
if(cy[i]==-1||dfs(cy[i]))
{
cx[u]=i;cy[i]=u;
return 1;
}
}
}
return 0;
}
int xyl()
{
int res=0;
REW(cy,-1);
REW(cx,-1);
FOR(i,1,n)
{
REW(vis,0);
if(dfs(i)) res++;
}
return res;
}
int main()
{
cin.tie(0);
cout.tie(0);
while(si(k)!=EOF&&k)
{
si(n),si(m);
int x,y;
REW(g,0);
FOR(i,1,k) si(x),si(y),g[x][y]=1;
cout<<xyl()<<endl;
}
return 0;
}