#include <iostream>
#include <stdio.h>
#include <set>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn=550;
struct node
{
    int age;
    char sex[5],music[110],sport[110];
}a[maxn];
int n;
struct Graph {
    int n, match[maxn];
    bool adj[maxn][maxn];
    void clear() {
        memset(adj, 0, sizeof(adj));
        n = 0;
    }
    void insert(const int &u, const int &v) {
       // get_max(n, max(u, v) + 1);
        adj[u][v] = adj[v][u] = 1;
    }
    int max_match() {
        memset(match, -1, sizeof(match));
        int ans = 0;
        for (int i = 0; i < n; ++i) {
            if (match[i] == -1) {
                ans += bfs(i);
            }
        }
        return ans;
    }
    int Q[maxn], pre[maxn], base[maxn];
    bool hash[maxn];
    bool in_blossom[maxn];
    int bfs(int p) {
        memset(pre, -1, sizeof(pre));
        memset(hash, 0, sizeof(hash));
        for (int i = 0; i < n; ++i) {
            base[i] = i;
        }
        Q[0] = p;
        hash[p] = 1;
        for (int s = 0, t = 1; s < t; ++s) {
            int u = Q[s];
            for (int v = 0; v < n; ++v) {
                if (adj[u][v] && base[u] != base[v] && v != match[u]) {
                    if (v == p || (match[v] != -1 && pre[match[v]] != -1)) {
                        int b = contract(u, v);
                        for (int i = 0; i < n; ++i) {
                            if (in_blossom[base[i]]) {
                                base[i] = b;
                                if (hash[i] == 0) {
                                    hash[i] = 1;
                                    Q[t++] = i;
                                }
                            }
                        }
                    } else if (pre[v] == -1) {
                        pre[v] = u;
                        if (match[v] == -1) {
                            argument(v);
                            return 1;
                        } else {
                            Q[t++] = match[v];
                            hash[match[v]] = 1;
                        }
                    }
                }
            }
        }
        return 0;
    }
    void argument(int u) {
        while (u != -1) {
            int v = pre[u];
            int k = match[v];
            match[u] = v;
            match[v] = u;
            u = k;
        }
    }
    void change_blossom(int b, int u) {
        while (base[u] != b) {
            int v = match[u];
            in_blossom[base[v]] = in_blossom[base[u]] = true;
            u = pre[v];
            if (base[u] != b) {
                pre[u] = v;
            }
        }
    }
    int contract(int u, int v) {
        memset(in_blossom, 0, sizeof(in_blossom));
        int b = find_base(base[u], base[v]);
        change_blossom(b, u);
        change_blossom(b, v);
        if (base[u] != b) {
            pre[u] = v;
        }
        if (base[v] != b) {
            pre[v] = u;
        }
        return b;
    }
    int find_base(int u, int v) {
        bool in_path[maxn] = {};
        while (true) {
            in_path[u] = true;
            if (match[u] == -1) {
                break;
            }
            u = base[pre[match[u]]];
        }
        while (!in_path[v]) {
            v = base[pre[match[v]]];
        }
        return v;
    }
} flower;
bool couple(node &a,node &b)
{
    if(abs(a.age-b.age)>40) return 0;
    if(a.sex[0]==b.sex[0]) return 0;
    if(strcmp(a.music,b.music)!=0) return 0;
    if(strcmp(a.sport,b.sport)==0) return 0;
    return 1;
}
void init()
{
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    scanf("%d%s%s%s",&a[i].age,a[i].sex,a[i].music,a[i].sport);
    flower.clear();
    flower.n=n;
    for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)
    if(couple(a[i],a[j]))
    {
        flower.insert(i,j);
//        printf("%d  %d\n",i,j);
    }
    printf("%d\n",n-flower.max_match());
}
int main()
{
     //freopen("in.txt","r",stdin);
    int w;
    cin>>w;
    while(w--)
    {
        init();
    }
    return 0;
}

• Re:我2b了，条件中sex项决定了此图是二分图，而不是一般的无向图，故可用匈牙利。（如果允许搞基就不行了) (2) WilliamACM 2013-03-18 18:55:36