Doing Homework
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6656 Accepted Submission(s): 2870
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 MathHintIn 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
Recommend
题目大意:输入一个n,后边n个作业,给出作业的名字,截止日期,做这个作业所用时间,每超截止日期一天就扣一分,问做完这些作业扣得最少的分,并输出做这些作业的顺序
ac代码
#include<stdio.h>
#include<string.h>
#define INF 0x3f3f3f3f
struct s
{
int now,pre,time,res;
}dp[1<<15];
struct S
{
char str[110];
int d,c;
}a[15];
int rt,n;
void solve()
{
int i,j,st,time,res;
for(i=1;i<=rt;i++)
{
dp[i].res=INF;
}
dp[0].time=0;
dp[0].res=0;
for(i=0;i<=rt;i++)
{
for(j=0;j<n;j++)
{
if(i&(1<<j))
continue;
st=i|(1<<j);
time=dp[i].time+a[j].c;
res=time-a[j].d;
if(res<0)
res=0;
int temp=dp[i].res+res;
if(dp[st].res>temp)
{
dp[st].res=temp;
dp[st].now=j;
dp[st].pre=i;
dp[st].time=time;
}
}
}
}
void print(int x)
{
if(x==0)
return;
print(dp[x].pre);
printf("%s\n",a[dp[x].now].str);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
//int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s%d%d",a[i].str,&a[i].d,&a[i].c);
}
rt=(1<<n)-1;
solve();
printf("%d\n",dp[rt].res);
print(rt);
}
}