Doing Homework
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6308 Accepted Submission(s): 2714
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.
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题意:n门课,每门课有截止时间和完成所需的时间,如果超过规定时间完成,每超过一天就会扣1分,问怎样安排做作业的顺序才能使得所扣的分最小。思路:初学dp,看了一下题解, 原来是状压dp。然后学着枚举状态,然后dp。代码:#include<iostream> #include<string> #include<stdio.h> #include<cstring> #include<algorithm> using namespace std; const int INF=1<<30; struct node { string name; int dead,cost; } a[50]; int ans[55],cnt; struct kode { int time,score,pre,now; } dp[1<<15]; int main() { int t,i,j,s,n,en; scanf("%d",&t); while(t--) { memset(dp,0,sizeof(dp)); scanf("%d",&n); for(i=0;i<n;i++) { cin >> a[i].name; scanf("%d%d",&a[i].dead,&a[i].cost); } en=1<<n; for(s=1;s<en;s++) { dp[s].score=INF; for(i = n-1; i>=0; i--) { int tem=1<<i; if(s&tem) { int past=s-tem; int st=dp[past].time+a[i].cost-a[i].dead; if(st<0) st=0; if(st+dp[past].score<dp[s].score) { dp[s].score = st+dp[past].score;//超过的时间 dp[s].now = i; dp[s].pre = past; dp[s].time = dp[past].time+a[i].cost;//总共用的时间 } } } } int tem = en-1; printf("%d\n",dp[tem].score); cnt=0; while(tem) { ans[cnt++]=dp[tem].now; tem = dp[tem].pre; } for(i=cnt-1;i>=0;i--) cout << a[ans[i]].name << endl; } return 0; }