Girls and Boys（二分图）

Girls and Boys

Time Limit: 5000MS		Memory Limit: 10000K
Total Submissions: 10059		Accepted: 4447

Description

In the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically involved" is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been "romantically involved". The result of the program is the number of students in such a set.

Input

The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:

the number of students
the description of each student, in the following format
student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
or
student_identifier:(0)

The student_identifier is an integer number between 0 and n-1 (n <=500 ), for n subjects.

Output

For each given data set, the program should write to standard output a line containing the result.

Sample Input

7
0: (3) 4 5 6
1: (2) 4 6
2: (0)
3: (0)
4: (2) 0 1
5: (1) 0
6: (2) 0 1
3
0: (2) 1 2
1: (1) 0
2: (1) 0

Sample Output

5
2

Source

Southeastern Europe 2000

最大独立集=点数-最大匹配数
求最大匹配数用匈牙利算法

#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
#include <cstring>

using namespace std;

#define MAXN 501

int match[MAXN];
vector<int> g[MAXN];
bool used[MAXN];
int n;

bool DFS(int x)
{
    for (int i = 0; i < g[x].size(); ++i)
    {
        int v = g[x].at(i);
        if (used[v] == false)
        {
            used[v] = true;
            if (match[v] == -1 || DFS(match[v]))
            {
                match[v] = x;
                return true;
            }
        }
    }
    return false;
}

int Hungry()
{
    int tot = 0;
    memset (match, -1, sizeof (match));
    for (int i = 0; i < n; ++i)
    {
        memset (used, false, sizeof(used));
        tot += (int)DFS(i);
    }
    return tot;
}

int main()
{
    int x, u, c;
    while (scanf("%d", &n) != EOF)
    {
        for (int i = 0; i < n; ++i)
            g[i].clear();
        for (int i = 0; i < n; ++i)
        {
            scanf("%d: (%d)",&u ,&c);
            while (c--)
            {
                scanf("%d", &x);
                g[u].push_back(x);
            }
        }
        printf("%d\n", n - (Hungry() >> 1));
    }
    return 0;
}