HDU 2444 The Accomodation of Students 二分图判断+最大匹配

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.

染色法判断是否为二分图
如果一直 WA，也许是因为输出“No” 而不是 “NO”

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#define mod 1000000007
using namespace std;
const int N = 506;
vector<int> vec[N];

int G[N][N], vis[N], pre[N];
int p, n, m, k;

int col[N];

bool dfs(int u, int c)
{
    col[u] = c;
    int len = vec[u].size();
    for(int i = 0; i < len; ++i)
    {
        if(col[vec[u][i]] == c)
            return 0;
        if(col[vec[u][i]] == 0 && !dfs(vec[u][i], -c))
            return 0;
    }
    return 1;
}

bool check()
{
    for(int i = 1; i <= n; ++i)
    {
        if(col[i] == 0)
        {
            if(!dfs(i, 1))
                return 0;
        }

    }
    return 1;
}

int find_path(int cur)
{
    for(int i = 1; i <= n; ++i)
    {
        if(!vis[i] && G[cur][i])
        {
            vis[i] = 1;
            if(pre[i] == 0 || find_path(pre[i]))
            {
                pre[i] = cur;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    int i, j, a, b, num;
    while(~scanf("%d%d", &n, &m))
    {
        memset(G, 0, sizeof G);
        memset(pre, 0, sizeof pre);
        memset(col, 0, sizeof col);
        for(i = 1; i <= n; ++i)
        vec[i].clear();
        for(i = 1; i <= m; ++i)
        {
            scanf("%d%d", &a, &b);
            vec[a].push_back(b);
            vec[b].push_back(a);
            G[a][b] = G[b][a] = 1;
        }
        if(check())
        {
            int ans = 0;
            for(i = 1; i <= n; ++i)
            {
                memset(vis, 0, sizeof vis);
                if(find_path(i))
                    ++ans;
            }
            printf("%d\n", ans/2);
        }
        else
            printf("No\n");
    }
    return 0;
}