POJ 2771

#include <iostream>
#include <string>
#define MAXN 505

using namespace std;

int _m[MAXN][MAXN];
int match[MAXN];
bool ck[MAXN];

struct node
{
    int _high;
    char M_F;
    string _music;
    string _habit;
};
int hungary(int a,int b);
node _node[MAXN];

int main()
{
   // freopen("acm.acm","r",stdin);
    int test;
    int i;
    int j;
    int n;
    cin>>test;
    while(test --)
    {
        cin>>n;
        for(i = 0; i < n; ++ i)
        {
            cin>>_node[i]._high;
            cin>>_node[i].M_F;
            cin>>_node[i]._music;
            cin>>_node[i]._habit;
        }
        memset(_m,0,sizeof(_m));
        for(i = 0; i < n; ++ i)
        {
            for(j = 0; j < i; ++ j)
            {
                if(abs(_node[i]._high-_node[j]._high) <= 40 && _node[i].M_F != _node[j].M_F && _node[i]._music == _node[j]._music && _node[i]._habit != _node[j]._habit)
                {
                    _m[i][j] = 1;
                    _m[j][i] = 1;
                }
            }
        }
        cout<<n-hungary(n,n)/2<<endl;
    }
}

/////////////////////////////////////////////////////////////////////////
//hungary算法，自己写的模板！
/////////////////////////////////////////////////////////////////////////
bool search(int a,int b,int x)
{
    int i;
    int t;
        for ( i = 0 ; i < b ; i++)
        if (_m[x][i] && ! ck[i])
        {
            ck[i] = true;
            t = match[i];
            match[i] = x;
            if (t == -1 || search(a,b,t))
                return true;
            match[i] = t;
        }
    return false;
}

int hungary(int a,int b)
{
    memset(match,-1,sizeof(match));
    int max_match = 0;
    int i;
    for ( i = 0 ; i < a ; i++)
    {
        memset(ck,false,sizeof(ck));
        if (search(a,b,i))
            max_match++;
    }
    return max_match;
}