HDU5045:Contest(状压dp)
来源:互联网 发布:linux命令解压缩 编辑:程序博客网 时间:2024/06/01 07:49
reference:http://blog.csdn.net/stay_accept/article/details/51232891
Contest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1759 Accepted Submission(s): 710
Problem Description
In the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are given 5 hours to solve between 8 and 12 programming problems.
On Mars, there is programming contest, too. Each team consist of N students. The teams are given M hours to solve M programming problems. Each team can use only one computer, but they can’t cooperate to solve a problem. At the beginning of the ith hour, they will get the ith programming problem. They must choose a student to solve this problem and others go out to have a rest. The chosen student will spend an hour time to program this problem. At the end of this hour, he must submit his program. This program is then run on test data and can’t modify any more.
Now, you have to help a team to find a strategy to maximize the expected number of correctly solved problems.
For each problem, each student has a certain probability that correct solve. If the ith student solve the jth problem, the probability of correct solve is Pij .
At any time, the different between any two students’ programming time is not more than 1 hour. For example, if there are 3 students and there are 5 problems. The strategy {1,2,3,1,2}, {1,3,2,2,3} or {2,1,3,3,1} are all legal. But {1,1,3,2,3},{3,1,3,1,2} and {1,2,3,1,1} are all illegal.
You should find a strategy to maximize the expected number of correctly solved problems, if you have know all probability
On Mars, there is programming contest, too. Each team consist of N students. The teams are given M hours to solve M programming problems. Each team can use only one computer, but they can’t cooperate to solve a problem. At the beginning of the ith hour, they will get the ith programming problem. They must choose a student to solve this problem and others go out to have a rest. The chosen student will spend an hour time to program this problem. At the end of this hour, he must submit his program. This program is then run on test data and can’t modify any more.
Now, you have to help a team to find a strategy to maximize the expected number of correctly solved problems.
For each problem, each student has a certain probability that correct solve. If the ith student solve the jth problem, the probability of correct solve is Pij .
At any time, the different between any two students’ programming time is not more than 1 hour. For example, if there are 3 students and there are 5 problems. The strategy {1,2,3,1,2}, {1,3,2,2,3} or {2,1,3,3,1} are all legal. But {1,1,3,2,3},{3,1,3,1,2} and {1,2,3,1,1} are all illegal.
You should find a strategy to maximize the expected number of correctly solved problems, if you have know all probability
Input
The first line of the input is T (1 ≤ T ≤ 20), which stands for the number of test cases you need to solve.
The first line of each case contains two integers N ,M (1 ≤ N ≤ 10,1 ≤ M ≤ 1000),denoting the number of students and programming problem, respectively.
The next N lines, each lines contains M real numbers between 0 and 1 , the jth number in the ith line is Pij .
The first line of each case contains two integers N ,M (1 ≤ N ≤ 10,1 ≤ M ≤ 1000),denoting the number of students and programming problem, respectively.
The next N lines, each lines contains M real numbers between 0 and 1 , the jth number in the ith line is Pij .
Output
For each test case, print a line “Case #t: ”(without quotes, t means the index of the test case) at the beginning. Then a single real number means the maximal expected number of correctly solved problems if this team follow the best strategy, to five digits after the decimal point. Look at the output for sample input for details.
Sample Input
12 30.6 0.3 0.40.3 0.7 0.9
Sample Output
Case #1: 2.20000
Source
2014 ACM/ICPC Asia Regional Shanghai Online
题意:n个人做m条题,其中每个人做每条题的正确率给出,要求每n条题都要这n个人各做1题。# include <stdio.h># include <algorithm>using namespace std;double a[11][1001], dp[1001][1050];//dp[i][j]表示前i条题目的j做题状况下最大正确率。int main(){ int t, n, m, tmp, cas=1; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(int i=1; i<=n; ++i) for(int j=1; j<=m; ++j) scanf("%lf",&a[i][j]); int up = 1<<n; for(int i=0; i<=m; ++i) for(int j=0; j<up; ++j) dp[i][j] = -1; dp[0][0] = 0; for(int i=1; i<=m; ++i) { for(int j=0; j<up; ++j) { if(dp[i-1][j] == -1) continue; for(int k=0; k<n; ++k) { if(!(j&(1<<k)))//如果这个人没做 { tmp = j|(1<<k); if(tmp == up-1)//如果全部人都有做了,就归零给下一个循环用。 tmp = 0; dp[i][tmp] = max(dp[i][tmp], dp[i-1][j] + a[k+1][i]); } } } } double imax = -1; for(int i=0; i<up; ++i) imax = max(imax, dp[m][i]); printf("Case #%d: %.5f\n",cas++, imax); } return 0;}
0 0
- HDU5045:Contest(状压dp)
- hdu5045 Contest 状压DP
- hdu5045 Contest ---- 状态DP
- HDU5045-Contest(DP+状态压缩)
- HDU5045 状压dp
- hdu5045 Contest(费用流)
- hdu5045(状态压缩dp)
- hdu5045(压缩状态DP)
- 2014上海网络赛1004||hdu5045 contest【状态压缩dp】
- hdu5045(dp + 状态压缩)
- hdu5045(状态压缩dp)
- hdu5045状态压缩DP
- hdu5045
- 状态压缩dp poj 3254 hdu5045
- HDU 5045 Contest(状压DP)
- HDU-5045 Contest(状压DP)
- hdu 5045 Contest (状压DP)
- HDU - 5045 Contest(DP+状压)
- Android异步消息处理机制完全解析,带你从源码的角度彻底理解
- hdu3549-Flow Problem(最大流&EK)
- zzulioj 1875
- meta实现页面加载完毕几秒后跳转至指定URL
- 最长上升子序列
- HDU5045:Contest(状压dp)
- php面试题汇总
- 入门训练 序列求和
- PAT 1014 福尔摩斯的约会
- Rails默认更新用户密码策略的修改
- linux之openssl简单介绍
- python 乱序数组,list等有序结构的方法
- SQL Server 基础(一)
- Orientation - 3