二分图匹配问题,首先要判断是否是二分图。如果是,则套用模板求最大匹配即可。
判断二分图的话用dfs染色就好啦。
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int n,m;
int used[202],match[202],u,v,color[202];
vector<int> G[202];
void Add(int u,int v){
G[u].push_back(v);
G[v].push_back(u);
}
int dfs(int u,int c){
color[u] =c;
for(int i = 0;i<G[u].size();i++){
int v = G[u][i];
if(color[v] == c) return 0;
if(!color[v] && !dfs(v,3-c)) return 0;
}
return 1;
}
int judge(){
memset(color,0,sizeof(color));
for(int i = 1;i<=n;i++){
if(!color[i]) if(!dfs(i,1)) return 0;
}
return 1;
}
int dfs(int u){
used[u] = 1;
for(int i = 0;i<G[u].size();i++){
int v = G[u][i],w = match[v];
if(w < 0 || !used[w] && dfs(w)) {
match[u] = v;
match[v] = u;
return 1;
}
}
return 0;
}
int main(){
while(~scanf("%d%d",&n,&m)){
memset(match,-1,sizeof(match));
for(int i = 1;i<=n;i++) G[i].clear();
for(int i = 0;i<m;i++){
scanf("%d%d",&u,&v);
Add(u,v);
}
int f = 0,res = 0;
if(!judge()) {
printf("No\n");
continue;
}
for(int i = 1;i<=n;i++){
if(match[i] < 0 ){
memset(used,0,sizeof(used));
if(dfs(i)) res++;
}
}
printf("%d\n",res);
}
return 0;
}