HDU 1074 Doing Homework【状压DP】

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1074

题目大意：有N个作业，每个作业有一个截止日期和完成这个作业所花费的时间，对于每一个作业，超过截止日期一天就会扣一分，求在扣分最少的情况下完成作业的顺序，如果有多种情况，按字典序从小到大输出。

分析：【状压DP】对于n种家庭作业，完成顺序有n!种，但n!太大，无法遍历每一种情况，我们可以将完成相同的作业的所有状态压缩成一种状态并记录扣的最少分即可 即：状态压缩dp 。

对于到达状态i,从何种状态到达i呢？只需要枚举所有的作业 
假如对于作业j,i中含有作业j已完成，那么状态i可以由和i状态相同的状态仅仅是j未完成的状态k=i-(1<<j)来完成j到达，同时更新记录数据。  

状态压缩DP最经典的问题是旅行商问题（TSP）

详解参见：http://blog.csdn.net/lmyclever/article/details/6671923

http://www.cnblogs.com/DeathKid/archive/2011/08/03/2126647.html

CODE：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<iostream>
#define INF 0x3f3f3f3f
typedef long long LL;
using namespace std;
const int maxn=(1<<15)+10;
int dp[maxn],t[maxn],pre[maxn];
//dp[i]:记录到达状态i扣的最少分
//t[i]:记录到达状态i在扣分最少的前提下花费了多少时间
//pre[i]:记录前驱，方便输出结果
struct node
{
    char s[108];
    int dead,cost;
} c[maxn];
int main()
{
    int tt,n;
    scanf("%d",&tt);
    while(tt--)
    {
        scanf("%d",&n);
        for(int i=0; i<n; i++)
            scanf("%s%d%d",c[i].s,&c[i].dead,&c[i].cost);
        for(int i=1; i<(1<<n); i++)
        {
            dp[i]=INF;
            for(int j=0; j<n; j++)
            {
                int temp=1<<j;
                if(!(i&temp)) continue;//状态i不存在作业j完成，则不能通过完成作业j到达状态i
                int score=t[i-temp]+c[j].cost-c[j].dead;//完成作业j超过截至日期所扣的分数（score<=0即能在规定的时间内完成，不扣分）
                if(score<0)   score=0;
                if(dp[i]>=dp[i-temp]+score)//更新dp[i]，t[i]，记录前驱pre[i]
                {
                    dp[i]=dp[i-temp]+score;
                    t[i]=t[i-temp]+c[j].cost;
                    pre[i]=j;
                }
            }
        }
        int x=(1<<n)-1;
        cout<<dp[x]<<endl;
        stack<string>s;
        while(!s.empty())
            s.pop();
        while(x)
        {
            s.push(c[pre[x]].s);
            //printf("%s\n",c[pre[x]].s);
            x=x-(1<<pre[x]);
        }
        while(!s.empty())
        {
            cout<<s.top()<<endl;
            s.pop();
        }
    }
    return 0;
}

题目描述：

Doing Homework

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

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