20140930 【 DP - 状态压缩】 2014-上海区域赛-网络预选赛 hdoj 5045 Contest

最新推荐文章于 2019-04-03 17:19:38 发布

ZONE画派

最新推荐文章于 2019-04-03 17:19:38 发布

阅读量633

点赞数

分类专栏： hdoj Asia DP

本文链接：https://blog.csdn.net/wilson1068/article/details/39694927

版权

hdoj 同时被 3 个专栏收录

26 篇文章 0 订阅

订阅专栏

Asia

9 篇文章 0 订阅

订阅专栏

6 篇文章 0 订阅

订阅专栏

Online Judge	Online Exercise	Online Teaching	Online Contests	Exercise Author
F.A.Q Hand In Hand Online Acmers Forum \| Discuss Statistical Charts	Problem Archive Realtime Judge Status Authors Ranklist	C/C++/Java Exams ACM Steps Go to Job Contest LiveCast ICPC@China	Best Coder ^beta VIP \| STD Contests Virtual Contests DIY \| Web-DIY ^beta Recent Contests	wilson1068 Mail 0 (0) Control Panel Sign Out

BestCoder官方群：385386683 欢迎加入~

寻人启事：2014级新生看过来！

Contest

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 603 Accepted Submission(s): 258

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 i ^th student solve the j ^th problem, the probability of correct solve is P _ij .

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 j ^th number in the i ^th line is P _ij .

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

      
      
       
       1
2 3
0.6 0.3 0.4
0.3 0.7 0.9

Sample Output

      
      
       
       Case #1: 2.20000

Source

2014 ACM/ICPC Asia Regional Shanghai Online

Recommend

hujie | We have carefully selected several similar problems for you: 5056 5055 5054 5053 5052

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2014 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.006283(s) query 7, Server time : 2014-09-30 13:40:12, Gzip disabled

Administration

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int MAXN = 1111;

double a[11][MAXN], f[MAXN][MAXN];
int n, m;
int main(){
    int T, tt;
    scanf("%d", &T);
    tt = T;
    while( T-- ){
        scanf("%d%d", &n, &m);
        for(int i=0; i<n; i++)
            for(int j=0; j<m; j++)
                scanf("%lf", &a[i][j]);

        int limit = 1<<n;
        double ans = 0;

        for(int i=0; i<=m; i++)
            for(int j=0; j<=limit; j++)
                f[i][j] = -1.0;

        f[0][0] = 0.0;
        for(int i=0; i<m; i++)
            for(int j=0; j<limit; j++){
                if( f[i][j]<0 ) continue;
                for(int k=0, st; k<n; k++)
                    if( 0==(j&(1<<k)) ){
                        st = j | (1<<k);
                        if( st==limit-1 )   st=0;
                        f[i+1][st] = max(f[i+1][st], f[i][j]+a[k][i]);
                        ans = max(ans, f[i+1][st]);
                    }
            }
        printf("Case #%d: %.5lf\n", tt-T, ans);
    }
    return 0;
}