hdu 1074 Doing Homework

2
3
Computer 3 3
English 20 1
Math 3 2
3
Computer 3 3
English 6 3
Math 6 3

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.

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<cstdlib>

#define BUG puts("ok");
#define CLR(a,b) memset((a),(b),sizeof((a)))
#define inf 16843009

using namespace std;
int const nMax=1000;
typedef long long LL;

struct Int
{
char s[110];
int d,c;
bool operator < (const Int &b)const{
return strcmp(s,b.s)<0;
}
};

Int a[20];
int n;
int dp[nMax],t[nMax],fa[nMax];

int DP(int u){
if(u==0)return dp[u]=0,t[u]=0;
if(dp[u]!=inf)return dp[u];
int v,k;
for(int i=0;i<n;i++){
if(u&(1<<i)){
v=u-(1<<i);
k=DP(v);
t[u]=t[v]+a[i].c;
if(t[u]>a[i].d){
if(dp[u]>=k+t[u]-a[i].d){//注意等号，因为要字典序。。。。。
dp[u]=k+t[u]-a[i].d;
fa[u]=i;
}
}else {
if(dp[u]>=k){
dp[u]=k;
fa[u]=i;
}
}
}
}
return dp[u];
}

void output(int m){
if(m==0)return ;
output(m-(1<<fa[m]));
printf("%s\n",a[fa[m]].s);
return ;
}

int main()
{
int cas;
scanf("%d",&cas);
while(cas--){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s%d%d",a[i].s,&a[i].d,&a[i].c);
}
sort(a,a+n);
memset(dp,1,sizeof(dp));//赋值为无穷大
int ans=DP((1<<n)-1);
printf("%d\n",ans);
int m=((1<<n)-1);
output(m);
}
return 0;
}