二分图 - The Accomodation of Students - HDU - 2444

最新推荐文章于 2024-07-23 17:36:37 发布

新城R

最新推荐文章于 2024-07-23 17:36:37 发布

阅读量95

点赞数

文章标签：算法 c++ 二分图染色法

本文链接：https://blog.csdn.net/weixin_51732964/article/details/120377865

版权

Problem Description

There are a group of students. Some of them may know each other, while others don’t. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other.

Now you are given all pairs of students who know each other. Your task is to divide the students into two groups so that any two students in the same group don’t know each other.If this goal can be achieved, then arrange them into double rooms. Remember, only paris appearing in the previous given set can live in the same room, which means only known students can live in the same room.

Calculate the maximum number of pairs that can be arranged into these double rooms.

Input

For each data set:
The first line gives two integers, n and m(1<n<=200), indicating there are n students and m pairs of students who know each other. The next m lines give such pairs.

Proceed to the end of file.

Output

If these students cannot be divided into two groups, print “No”. Otherwise, print the maximum number of pairs that can be arranged in those rooms.

Sample Input

Sample Output

No
3

题意：将所有人分为两组且组内不能有相互认识的，若不能则输出No，若能则将朋友两两匹配，并求出匹配数
理解：利用染色法来判断是否能成功分组，再利用二分图最大匹配来分组

#include<bits/stdc++.h>
using namespace std;
#define N 210
int n,m,a,b,f,i,x;
int v[N],bk[N],match[N],e[N][N];
int bfs()
{
	memset(v,0,sizeof(v));
	queue<int>q;
	q.push(1);
	v[1]=1;
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(i=1;i<=n;i++)
			if(e[x][i])
			{
				if(!v[i])
				{
					v[i]=-v[x];
					q.push(i);
				}
				else if(v[i]==v[x])
					return 0;
			}
	}
	return 1;
}
int cha(int x)
{
	for(int i=1;i<=n;i++)
		if(!bk[i]&&e[x][i])
		{
			bk[i]=1;
			if(!match[i]||cha(match[i]))
			{
				match[i]=x;
				return 1;
			}
		}
	return 0;
}
int dfs()
{
	int ans=0;
	memset(match,0,sizeof(match));
	for(i=1;i<=n;i++)
	{
		memset(bk,0,sizeof(bk));
		if(cha(i)) ans++;
	}
	return ans;
}
int main()
{
	
	while(cin>>n>>m)
	{
		memset(e,0,sizeof(e));
		for(i=0;i<m;i++)
		{
			cin>>a>>b;
			e[a][b]=1;
		}
		if(!bfs()) cout<<"No"<<endl;
		else cout<<dfs()<<endl;
	}
}