light oj 1184 Marriage Media

题目：

You run a marriage media. You take some profiles for men and women, and your task is to arrange as much marriages as you can. But after reading their bio-data you have found the following criteria.

1. No man will marry a woman if their height gap is greater than 12 inches.
2. No woman will marry a man if their age gap is greater than 5 years.
3. A couple can be formed if either both are not divorced or both are divorced.
4. Of course, a man can marry a single woman and vice versa.

Now you are given the bio-data of some men and women, you have to arrange the maximum number of marriages considering the given criteria.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case contains two integer m, n (1 ≤ m, n ≤ 50). Each of the next m lines will contain the information for a man, and each of the next n lines will contain the information for a woman. An information will contain three integers denoting the height in inches, age in years and 1 or 0 depending on they are divorced or not respectively. Assume that Height will be between 50 and 80, age will be between 20 and 50.

Output

For each case, print the case number and the maximum number of marriages you can arrange.

Sample Input

2

2 2

70 30 0

60 20 0

71 25 0

71 35 0

1 1

70 30 1

70 30 0

Sample Output

Case 1: 2

Case 2: 0

题意描述：

很有意思的题目，给你m个男士和n个女士的身高、年龄、和婚姻状况，问你最多能凑成多少对。

解题思路：

二分最大匹配问题，使用匈牙利算法，改变一下判断条件即可。

AC代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
struct P
{
    int h,a,f,p;
};
struct P man[55],wom[55];
int m,n,book[55];
int maxmatch();
int path(int u);
int main()
{
    int T,c=1,i;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&m,&n);
        for(i=1;i<=m;i++)
            scanf("%d%d%d",&man[i].h,&man[i].a,&man[i].f);
        for(i=1;i<=n;i++)
            scanf("%d%d%d",&wom[i].h,&wom[i].a,&wom[i].f);
            
        printf("Case %d: %d\n",c++,maxmatch());
        /*for(i=1;i<=m;i++)
            printf("%d号和%d号般配\n",i,man[i].p);*/
    }
    return 0;
} 

int maxmatch()
{
    int i,res=0;
    for(i=1;i<=n;i++)
        wom[i].p=0;
    for(i=1;i<=m;i++)
        man[i].p=0;
    for(i=1;i<=m;i++)
    {
        if(!man[i].p)
        {
            memset(book,0,sizeof(book));
            res += path(i);
        }
    }
    return res;
}
int path(int u)
{
    int i;
    for(i=1;i<=n;i++)
    {
        if(!book[i] && fabs(man[u].h-wom[i].h)<=12
        && fabs(man[u].a-wom[i].a)<=5 && man[u].f==wom[i].f)
        {
            book[i]=1;
            if(!wom[i].p || path(wom[i].p))
            {
                man[u].p=i;
                wom[i].p=u;
                //printf("男%d号和女%d号般配\n",u,man[u].p);
                return 1;
            }
        }
    }
    return 0;
}