hdoj 2444 The Accomodation of Students（二分图判定+匈牙利裸题）

最新推荐文章于 2017-10-03 18:39:00 发布

键盘里的青春

最新推荐文章于 2017-10-03 18:39:00 发布

阅读量574

点赞数

分类专栏：二分图/匹配 ACM

本文链接：https://blog.csdn.net/qq_34374664/article/details/74783246

版权

ACM 同时被 2 个专栏收录

506 篇文章 33 订阅

订阅专栏

二分图/匹配

18 篇文章 1 订阅

订阅专栏

The Accomodation of Students

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

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

Source

2008 Asia Harbin Regional Contest Online

Recommend

gaojie

题意：

一些学生之间是朋友关系（关系不能传递），现在要将一堆学生分成两堆,使得在同一堆的学生之间没有朋友关系。如果不可以输出“No”，可以的话输出最多可以分出几对小盆友（最大匹配）。

思路：bfs判断二分图，然后匈牙利。。。最后答案/2，因为是双向二分图

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 2e3 + 5;
vector<int> v[maxn];
int n, m, match[maxn], book[maxn];
int judge()
{
    queue<int> q;
    memset(book, -1, sizeof(book));
    q.push(1);
    book[1] = 0;
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        for(int i = 0; i < v[u].size(); i++)
        {
            int to = v[u][i];
            if(book[to] == -1)
            {
                book[to] = !book[u];
                q.push(to);
            }
            else if(book[to] == book[u])
                return 0;
        }
    }
    return 1;
}
int Find(int x)
{
    for(int i = 0; i < v[x].size(); i++)
    {
        int to = v[x][i];
        if(book[to]) continue;
        book[to] = 1;
        if(match[to] == 0 || Find(match[to]))
        {
            match[to] = x;
            return 1;
        }
    }
    return 0;
}
int main()
{
    while(~scanf("%d%d", &n, &m))
    {
        int x, y;
        for(int i = 0; i <= n; i++)
            v[i].clear();
        memset(match, 0, sizeof(match));
        for(int i = 1; i <= m; i++)
        {
            scanf("%d%d", &x, &y);
            v[x].push_back(y);
            v[y].push_back(x);
        }
        if(!judge())
        {
            printf("No\n");
            continue;
        }
        int ans = 0;
        for(int i = 1; i <= n; i++)
        {
            memset(book, 0, sizeof(book));
            ans += Find(i);
        }
        printf("%d\n", ans/2);
    }
    return 0;
}