B - 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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
int n, m;
int ma[218][211];
int flag[211];
int v[211];
int match[211];
int bfs()//染色判断是否是二分图
{
    memset(flag, 0, sizeof(flag));//清零，没有被染色
    for(int j=1;j<=n;j++)
    {
        if(flag[j]!=0)//如果已经被染色，继续
            continue;
      //否则，bfs进行判断
    int front = 0, rear = 0;
    int que[12111], k;
    flag[j] = 1;//标记一种颜色
    que[rear++] = j;//入列
    while(front<rear)
    {
        k = que[front++];
        for(int i=1;i<=n;i++)
        {
            if(ma[k][i]==1&&flag[i]==flag[k])//如果，与其相邻的是同一种颜色，则不是二分图，直接退出
            {
                return 0;
            }
            if(ma[i][k]==1&&flag[i]==0)//如果与其相邻的是没有被标记过的，则标记，入列
            {
                flag[i] = -flag[k];
                que[rear++] = i;
            }
        }
    }
    }
    return 1;
}
bool dfs(int u)//匈牙利（dfs）
{
    for(int i=1;i<=n;i++)
    {
        if(ma[u][i]==1&&v[i]==0)
        {
            v[i] = 1;
            if(match[i]==-1||dfs(match[i]))
            {
                match[i] = u;
                return true;
            }
        }
    }
    return false;
}
int g()
{
    int ans = 0;
    memset(match, -1, sizeof(match));
    for(int i=1;i<=n;i++)
    {
        memset(v, 0, sizeof(v));
        if(dfs(i))
            ans++;
    }
    return ans;
}
int main()
{
    while(cin>>n>>m)
    {
        memset(ma, 0, sizeof(ma));
        for(int i=0;i<m;i++)
        {
            int a, b;
            cin>>a>>b;
            ma[a][b] = ma[b][a] = 1;
        }
        if(!bfs())
        {
            cout<<"No"<<endl;
            continue;
        }
        printf("%d\n", g()/2);
    }
    return 0;
}