HDU 2444 The Accomodation of Students 二分图判定 二分匹配

题意：有n个人，给出其中相互认识的几对，求出是否能够分出两组人，其中每组中任意两个人互不认识，然后将两组中认识的两个人分到同一个房间里，若能分出这样的两组，求出分到的房间的最多个数
思路：即判定给定图是否是二分图，若是二分图则求最大匹配。判定二分图用bfs染色法，对于每个点，与其连接的点染上与其相反的颜色，若某点连接的点与其颜色相同，说明图不是二分图

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 200+5;
const int inf = 0x3f3f3f3f;
int n, m, vis[maxn], have[maxn], c[maxn];
vector<int> g[maxn];
int bfs(int s)
{
	queue<int> q;
	q.push(s);
	c[s] = 1;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (int i = 0; i < g[u].size(); i++) {
			int v = g[u][i];
			if (c[v] == -1) {
				q.push(v);
				c[v] = !c[u];
			}
			if (c[v] == c[u])
				return 0;
		}
	}
	return 1;
}
int dfs(int u)
{
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (!vis[v]) {
			vis[v] = 1;
			if (have[v] == -1 || dfs(have[v])) {
				have[v] = u;
				return 1;
			}
		}
	}
	return 0;
}
int main()
{
	while (~scanf("%d%d", &n, &m)) {
		memset(have, -1, sizeof(have));
		memset(c, -1, sizeof(c));
		for (int i = 0; i < maxn; i++)
			g[i].clear();
		for (int i = 0; i < m; i++) {
			int x, y;
			scanf("%d%d", &x, &y);
			g[x].push_back(y);
			g[y].push_back(x);
		}
		int flag = 0;
		for (int i = 1; i <= n; i++) {
			if (c[i] == -1 && !bfs(i)) {
				flag = 1;
				break;
			}
		}
		if (flag || n == 1) {
			printf("No\n");
			continue;
		} else {
			int ans = 0;
			for (int i = 1; i <= n; i++) {
				memset(vis, 0, sizeof(vis));
				if (dfs(i))
					ans++;
			}
			printf("%d\n", ans/2);
		}
	}
	return 0; 
}