POJ 2771 Guardian of Decency（最大独立集数=顶点数-最大匹配数）

题目链接：

http://poj.org/problem?id=2771

Description

Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afraid that some of them might become couples. While you can never exclude this possibility, he has made some rules that he thinks indicates a low probability two persons will become a couple:

• Their height differs by more than 40 cm.
• They are of the same sex.
• Their preferred music style is different.
• Their favourite sport is the same (they are likely to be fans of different teams and that would result in fighting).

So, for any two persons that he brings on the excursion, they must
satisfy at least one of the requirements above. Help him find the
maximum number of persons he can take, given their vital information.

Input

The
first line of the input consists of an integer T ≤ 100 giving the number
of test cases. The first line of each test case consists of an integer N
≤ 500 giving the number of pupils. Next there will be one line for each
pupil consisting of four space-separated data items:

• an integer h giving the height in cm;
• a character 'F' for female or 'M' for male;
• a string describing the preferred music style;
• a string with the name of the favourite sport.

No string in the input will contain more than 100 characters, nor will any string contain any whitespace.

Output

For each test case in the input there should be one line with an integer giving the maximum number of eligible pupils.

Sample Input

2
4
35 M classicism programming
0 M baroque skiing
43 M baroque chess
30 F baroque soccer
8
27 M romance programming
194 F baroque programming
67 M baroque ping-pong
51 M classicism programming
80 M classicism Paintball
35 M baroque ping-pong
39 F romance ping-pong
110 M romance Paintball

Sample Output

3
7

 /*
 问题
 输入n个人的信息，如果他们满足几个条件就视为存在成为一对的关系，求不能成为一对的最大子独立集的顶点个数 

 解题思路
 图论的题很绕，让我们理清关系，求最大子图，就是挑几个人，他们相互之间都存在一种不能成为一对的关系，最多有多少人
 做图的时候，将存在能成为一对的关系的置为1，否则都置为0，跑一边匈牙利算法得到最大匹配数
 那么顶点数n减去最大匹配数就是最大子独立集的个数了。
 */
 #include<cstdio>
 #include<iostream>
 #include<string>
 #include<cstring>
 #include<cmath>

 using namespace std;
 const int maxn=;
 int n,e[maxn][maxn],fn,mn;
 int cx[maxn],cy[maxn];
 int book[maxn];
 struct PER{
     int age;
     string sex,music,sport;
 }fper[maxn],mper[maxn];

 int ok(struct PER a, struct PER b);
 int maxmatch();
 int dfs(int u);

 int main()
 {
     int T,i,j;
     int x;
     char s1[],s2[],s3[];
     scanf("%d",&T);
     while(T--){
         scanf("%d",&n);
         fn=mn=;
         for(i=;i<n;i++){
             scanf("%d%s%s%s",&x,s1,s2,s3);
             if(strcmp(s1,"F") == ){
                 fper[fn].age=x;
                 fper[fn].sex=s1;
                 fper[fn].music=s2;
                 fper[fn].sport=s3;
                 fn++;
             }
             else{
                 mper[mn].age=x;
                 mper[mn].sex=s1;
                 mper[mn].music=s2;
                 mper[mn].sport=s3;
                 mn++;
             }
         }

         memset(e,,sizeof(int)*maxn*maxn);
         for(i=;i<mn;i++){
             for(j=;j<fn;j++){
                 if(ok(mper[i],fper[j]))
                     e[i][j]=;
             }
         }
         printf("%d\n",n-maxmatch());
     }
     return ;
 }

 int ok(struct PER a, struct PER b){
     if(abs(a.age - b.age) > )
         return ;
     if(a.sex == b.sex)
         return ;
     if(a.music != b.music)
         return ;
     if(a.sport == b.sport)
         return ;

     return ;
 }

 int dfs(int u)
 {
     for(int i=;i<fn;i++){
         if(book[i] ==  && e[u][i]){
             book[i]=;

             if(cy[i] == - || dfs(cy[i])){
                 cx[u]=i;
                 cy[i]=u;
                 return ;
             }
         }
     }
     return ;
 }    

 int maxmatch()
 {
     int i;
     memset(cx,-,sizeof(cx));
     memset(cy,-,sizeof(cy));
     int ans=;
     for(i=;i<mn;i++){
         if(cx[i] == -){
             memset(book,,sizeof(book));
             if(dfs(i))    ans++;
         }
     }
     return ans;
 }