Marriage Ceremonies
来源:互联网 发布:变漂亮 知乎 编辑:程序博客网 时间:2024/06/01 10:09
Description
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 jth integer in the ith line denotes the priority index between the ith man and jth woman. All the integers will be positive and not greater than 10000.
Output
Sample Input
2
2
1 5
2 1
3
1 2 3
6 5 4
8 1 2
Sample Output
Case 1: 7
Case 2: 16
#include <cstdio> #include <cstring> #include <queue> #include <stack> #include <vector> #include <set> #include <algorithm> using std::max; int a[17][17],dp[17][1<<17]; int main() { int T,n,ca=1; scanf("%d",&T); while(T--) { scanf("%d",&n); for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%d",&a[i][j]); //init for(int i=0;i<n;i++) for(int j=0;j<1<<n;j++) dp[i][j]=-1; for(int i=0;i<n;i++) dp[0][1<<i]=a[0][i]; //更新 for(int i=1;i<n;i++) { for(int j=0;j<1<<n;j++)if(dp[i-1][j]!=-1) { for(int k=0;k<n;k++)if((j&(1<<k))==0)//注意优先级,加括号 { dp[i][j|(1<<k)]=max(dp[i][j|(1<<k)],dp[i-1][j]+a[i][k]); } } } printf("Case %d: %d\n",ca++,dp[n-1][(1<<n)-1]); } return 0; }
- Marriage Ceremonies
- B - Marriage Ceremonies
- lightoj 1011 Marriage Ceremonies
- LightOJ 1011 - Marriage Ceremonies
- LightOJ 1011 Marriage Ceremonies
- 1011 - Marriage Ceremonies
- LightOJ 1011 Marriage Ceremonies
- light 1011 - Marriage Ceremonies
- LightOJ 1011 - Marriage Ceremonies (dp)
- LightOJ1011---Marriage Ceremonies (状压dp)
- lightoj1011 - Marriage Ceremonies【状压dp】
- Marriage Ceremonies--Light OJ 1011
- 1011 - Marriage Ceremonies[状态压缩dp]
- 【DP】 LightOJ 1011 - Marriage Ceremonies状压
- Light 1011 - Marriage Ceremonies (费用流)
- LightOJ 1011 Marriage Ceremonies【状压DP】
- light oj 1011 Marriage Ceremonies(状压DP)
- LightOJ 1011 - Marriage Ceremonies (状压dp)
- oracle的表空间的相关概念
- 纵向柱状图的CSS写法
- KVM 虚拟机命令行安装配置
- project工程文件不显示svn版本号
- CodeForces 173 C. Spiral Maximum 解题报告
- Marriage Ceremonies
- Python模块logging
- android_编译系统/Framework简介
- 麦当劳理论
- 进度条的CSS写法
- vc6 单例模式release版本出错的解决方法
- PO VO BO DTO POJO DAO
- 半透明弹出层的CSS写法
- oracle sql语句积累