POJ 2771 Guardian of Decency

Guardian of Decency

Time Limit: 3000ms

Memory Limit: 65536KB

This problem will be judged on PKU. Original ID: 2771
64-bit integer IO format: %lld      Java class name: Main

 

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

Source

Northwestern Europe 2005

 

解题：最大独立集，最大独立集等于点数-最大匹配数

 

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cmath>
using namespace std;
const int maxn = 1000;
struct STU {
    int height;
    string sex,music,sport;
};
vector<STU>stus;
vector<int>e[maxn];
bool can(STU &a,STU &b){
    int cao = a.height - b.height;
    if(cao < 0) cao = -cao;
    return cao<=40 && a.sex!=b.sex&&a.music==b.music&&a.sport!=b.sport;
}
int Link[maxn];
bool T[maxn];
bool match(int u) {
    for(int i = e[u].size()-1; i >= 0; --i) {
        if(!T[e[u][i]]) {
            T[e[u][i]] = true;
            if(Link[e[u][i]] == -1 || match(Link[e[u][i]])) {
                Link[e[u][i]] = u;
                return true;
            }
        }
    }
    return false;
}
int main() {
    int kase,n;
    STU stu;
    ios::sync_with_stdio(false);
    cin>>kase;
    while(kase--) {
        stus.clear();
        cin>>n;
        for(int i = 0; i < maxn; ++i) e[i].clear();
        for(int i = 0; i < n; ++i) {
            cin>>stu.height>>stu.sex>>stu.music>>stu.sport;
            stus.push_back(stu);
        }
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < n; ++j)
                if(can(stus[i],stus[j]))
                    e[i].push_back(j);
        int ret = 0;
        memset(Link,-1,sizeof Link);
        for(int i = 0; i < n; ++i) {
            memset(T,false,sizeof T);
            if(match(i)) ++ret;
        }
        cout<<(n-(ret>>1))<<endl;
    }
    return 0;
}