HDU 1074状压DP

Doing Homework

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8945    Accepted Submission(s): 4193

Problem Description

Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test, 1 day for 1 point. And as you know, doing homework always takes a long time. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.

 

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case start with a positive integer N(1<=N<=15) which indicate the number of homework. Then N lines follow. Each line contains a string S(the subject's name, each string will at most has 100 characters) and two integers D(the deadline of the subject), C(how many days will it take Ignatius to finish this subject's homework). 

Note: All the subject names are given in the alphabet increasing order. So you may process the problem much easier.

 

Output

For each test case, you should output the smallest total reduced score, then give out the order of the subjects, one subject in a line. If there are more than one orders, you should output the alphabet smallest one.

 

Sample Input

2

3

Computer 3 3

English 20 1

Math 3 2

3

Computer 3 3

English 6 3

Math 6 3

 

Sample Output

2

Computer

Math

English

3

Computer

English

Math

Hint

In the second test case, both Computer->English->Math and Computer->Math->English leads to reduce 3 points, but the word "English" appears earlier than the word "Math", so we choose the first order. That is so-called alphabet order.

 

Author

Ignatius.L

 

 题意：

有n种作业，每种作业有一个上交时间和写完这个作业花费的时间，每种作业超过上交时间几天完成就扣几分，问如何安排作业顺序才能扣分最少。

代码：

//只有15种作业，压缩一下状态，枚举状态然后枚举这个状态能做的每一种作业，
//若这个作业在这时做是否最优，进行dp.
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
int t,n,cost[20],dead[20];
char pro[20][110];
struct Lu{
    int sco,tim,now,pre;
}L[1<<15];
int main()
{
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
            scanf("%s%d%d",pro[i],&dead[i],&cost[i]);
        int N=1<<n;
        for(int i=1;i<N;i++) L[i].sco=inf;
        L[0].sco=L[0].tim=0;
        for(int i=1;i<N;i++){
            for(int j=n;j>=1;j--){
                if(i&(1<<(n-j))){
                    int sta=i^(1<<(n-j));
                    int p=L[sta].tim+cost[j]-dead[j];
                    if(p<0) p=0;
                    if(L[i].sco>L[sta].sco+p){
                        L[i].sco=L[sta].sco+p;
                        L[i].tim=L[sta].tim+cost[j];
                        L[i].now=j;
                        L[i].pre=sta;
                    }
                }
            }
        }
        printf("%d
",L[N-1].sco);
        int p=N-1,ans[20],nu=0;
        while(p){
            ans[++nu]=L[p].now;
            p=L[p].pre;
        }
        for(int i=nu;i>=1;i--)
            printf("%s
",pro[ans[i]]);
    }
    return 0;
}