（状压） Marriage Ceremonies （lightOJ 1011）

http://www.lightoj.com/volume_showproblem.php?problem=1011

You work in a company which organizes marriages. Marriages are not that easy to be made, so, the job is quite hard for you.

The job gets more difficult when people come here and give their bio-data with their preference about opposite gender. Some give priorities to family background, some give priorities to education, etc.

Now your company is in a danger and you want to save your company from this financial crisis by arranging as much marriages as possible. So, you collect N bio-data of men and N bio-data of women. After analyzing quite a lot you calculated the priority index of each pair of men and women.

Finally you want to arrange N marriage ceremonies, such that the total priority index is maximized. Remember that each man should be paired with a woman and only monogamous families should be formed.

Input

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

Each case contains an integer N (1 ≤ n ≤ 16), denoting the number of men or women. Each of the next N lines will contain N integers each. The j^th integer in the i^th line denotes the priority index between the i^th man and j^th woman. All the integers will be positive and not greater than 10000.

Output

For each case, print the case number and the maximum possible priority index after all the marriages have been arranged.

Sample Input

Output for Sample Input

1 5

2 1

1 2 3

6 5 4

8 1 2

Case 1: 7

Case 2: 16

题目大意：

公司组织婚礼，有 n 个男生和 n 个女生匹配，不同的人匹配会有不同的匹配值，求最大的匹配值

dp[i][j] i代表前i个人，j 包含了将要匹配的所有状态（0为未匹配，1为已经匹配）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>

using namespace std;

#define N 1100

#define met(a,b) (memset(a,b,sizeof(a)))
typedef long long LL;

int a[20][20], dp[20][(1<<17)];

int main()
{
    int T, iCase=1;

    scanf("%d", &T);

    while(T--)
    {
        int n, i, j, k, K;

        scanf("%d", &n);

        for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            scanf("%d", &a[i][j]);

        K = (1<<n)-1;
        for(i=1; i<=n; i++)
        {
            for(j=0; j<=K; j++)
            {
                dp[i][j] = 0;
                int cnt = 0;
                for(k=0; k<n; k++)///cnt算出j这个状态有多少个人匹配
                    if(j&(1<<k)) cnt++;
                ///如果有i个人匹配， 便可进行下面的状态转化
                if(cnt!=i) continue;
                for(k=1; k<=n; k++)
                {
                    if( (j&(1<<(k-1))) )
                        dp[i][j] = max(dp[i][j], dp[i-1][j-(1<<(k-1))]+a[i][k]);
                }
            }
        }

        printf("Case %d: %d
", iCase++, dp[n][K]);
    }
    return 0;
}