HDU——T 2444 The Accomodation of Students

http://acm.hdu.edu.cn/showproblem.php?pid=2444

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7087    Accepted Submission(s): 3168

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

4 4 1 2 1 3 1 4 2 3 6 5 1 2 1 3 1 4 2 5 3 6

 

Sample Output

No 3

 

Source

2008 Asia Harbin Regional Contest Online

 

Recommend

gaojie   |   We have carefully selected several similar problems for you:  2438 2443 2442 2441 2440 

 

 

蒟蒻无脑法：二分图染色+二分图匹配模板

代码好诡异

#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>

using namespace std;

const int N(233);
int n,m,head[N],sumedge;
struct Edge
{
    int v,next;
    Edge(int v=0,int next=0):v(v),next(next){}
}edge[233333];
inline void ins(int u,int v)
{
    edge[++sumedge]=Edge(v,head[u]);
    head[u]=sumedge;
    edge[++sumedge]=Edge(u,head[v]);
    head[v]=sumedge;
}

int col[N];
bool Paint(int x)
{
    col[x]=0;
    queue<int>que;
    que.push(x);
    for(int u,v;!que.empty();)
    {
        u=que.front(); que.pop();
        for(int i=head[u];i;i=edge[i].next)
        {
            v=edge[i].v;
            if(col[v]!=-1)
            {
                if(col[v]==col[u])
                    return false;
            }
            else
            {
                col[v]=col[u]^1;
                que.push(v);
            }
        }
    }
    return true;
}

int sumvis,vis[N],match[N],Map[N][N];
bool find(int u)
{
    /*for(int v,i=head[i];i;i=edge[i].next)
    {
        v=edge[i].v;
        if(!vis[v])
        {
            vis[v]=1;
            if(!match[v]||find(match[v]))
            {
                match[v]=u;
                return true;
            }
        }
    }*/
    for(int v=1;v<=n;v++)
        if(Map[u][v]&&!vis[v])
        {
            vis[v]=1;
            if(!match[v]||find(match[v]))
            {
                match[v]=u;
                return true;
            }
        }
    return false;
}

inline void init()
{
    memset(edge,0,sizeof(edge));
    memset(head,0,sizeof(head));
    memset(match,0,sizeof(match));
}

int main()
{
    for(;~scanf("%d%d",&n,&m);init())
    {
        int ans=0,flag=0;sumvis=0;
        memset(Map,0,sizeof(Map));
        for(int u,v;m--;ins(u,v))
            scanf("%d%d",&u,&v),Map[u][v]=1;
        memset(col,-1,sizeof(col));
        for(int i=1;i<=n;i++)
            if(col[i]==-1)
                if(!Paint(i))
                {
                    flag=1;
                    break;
                }
        if(flag)
        {
            puts("No");
            continue;
        }
        for(int i=1;i<=n;i++)
        {
            if(find(i)) ans++;
            memset(vis,0,sizeof(vis));
        }
        printf("%d
",ans);
    }
    return 0;
}