版权声明:最后一年,加油~ https://blog.csdn.net/zzti_xiaowei/article/details/81115693
思路:
我就不bb了~~
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max_n=1e4+10;
int n,k;
bool used[Max_n];
int match[Max_n];
vector<int>G[Max_n];
bool dfs(int u){
used[u]=1;
for(int i=0;i<G[u].size();i++){
int v=G[u][i];
int w=match[v];
if(w<0||!used[w]&&dfs(w)){
match[v]=u;
return true;
}
}
return false;
}
int main()
{
scanf("%d%d",&n,&k);
int a,b;
for(int i=0;i<k;i++){
scanf("%d%d",&a,&b);
G[a].push_back(b+n);
}
int ans=0;
memset(match,-1,sizeof(match));
for(int i=1;i<=n;i++){
memset(used,0,sizeof(used));
if(dfs(i)){
ans++;
}
}
printf("%d\n",ans);
return 0;
}