ZOJ 1137 最大独立数

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1137

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.

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, for n subjects.
For each given data set, the program should write to standard output a line containing the result.

An example is given in Figure 1.

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

Output

5
2

题目大意：给出一些男同学和女同学关系，让你给他们分组，使得每个分组中的男女同学互相不认识，问最大的分组数。

思路：即求二分图的最大独立数，最大独立数=顶点数-最小覆盖数=顶点数-最大匹配数。因为答案要分组数，因此要除2。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int n,m,t;
int s[1005][1005];
int vis[1005];
int pre[1005];

bool dfs(int x)
{
    for(int i=0;i<n;i++)
    {
        if(vis[i]==0&&s[x][i])
        {
            vis[i]=1;
            if(pre[i]==-1||dfs(pre[i]))
            {
                pre[i]=x;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    while(~scanf("%d",&n))
    {
        m=n;
        memset(pre,-1,sizeof(pre));
        memset(s,0,sizeof(s));
        int t,cnt,v;
        for(int i=0;i<m;i++)
        {
            scanf("%d: (%d)",&t,&cnt);
            while(cnt--)
            {
                scanf("%d",&v);
                s[i][v]=1;
            }
        }
        int ans=0;
        for(int i=0;i<m;i++)
        {
            memset(vis,0,sizeof(vis));
            ans+=dfs(i);
        }
        printf("%d\n",(2*m-ans)/2);
    }
    return 0;
}