HDU 2444 The Accomodation of Students【二分图匹配】

题目链接

题意

给出一张图，判断是否是二分图，如果是求出最大匹配

题解

二分图染色+最大匹配

#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<list>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#include<random>
using namespace std;

#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
#define mid ((l+r)>>1)
#define mem(x,y) memset(x,y,sizeof x)

const int mod = 1e9+7;
int qpow(int a,int b){
	int ans=1;
	while(b){
		if(b&1)ans=(ans*a)%mod;
		a=(a*a)%mod;
		b>>=1;
	}
	return ans;
}
const int INF = 0x3f3f3f3f;
const int N = 1e6+10;
struct edge{
	int to,next;
}e[20000];
int head[N],linker[N],vis[N],col[N];
int n,m,ans,k;
void add(int u,int v){
	e[++k].to=v;
	e[k].next=head[u];
	head[u]=k;
}

void init(){
	memset(linker,-1,sizeof linker);
	memset(head,0,sizeof head);
	memset(col,-1,sizeof col);
	k=0;
}
bool bfs(){
	queue<int>q; while(!q.empty())q.pop();
	q.push(1); col[1]=1;
	while(!q.empty()){
		int u=q.front(),color=col[u]; vis[u]=1; q.pop();
		for(int i=head[u];i;i=e[i].next){
			int v=e[i].to;
			if(col[v]!=-1){
				if(!(col[v]^color))return false;
				else continue;
			}
			col[v]=color^1;
			q.push(v);
		}
	}
	return true;
}
int find(int u){
	for(int i=head[u];i;i=e[i].next){
		int v=e[i].to;
		if(!vis[v]){
			vis[v]=1;
			if(linker[v]==-1||find(linker[v])){
				linker[u]=v,linker[v]=u;
				return 1;
			}
		}
	}
	return 0;
}
int solve(){
	int ans=0;
	for(int i=1;i<=n;i++){
		memset(vis,0,sizeof vis);
		if(linker[i]==-1&&find(i))ans++;
	}
	return ans;
}
#define endl '\n'
signed main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	while(cin>>n>>m){
		init();
		for(int i=1;i<=m;i++){
			int u,v; cin>>u>>v;
			add(u,v); add(v,u);
		}
		if(!bfs()){
			cout<<"No"<<endl; continue;
		}
		cout<<solve()<<endl;
	}
}