HDOJ 题目5188 zhx and contest（01背包，限制）

zhx and contest

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 585    Accepted Submission(s): 204

Problem Description

As one of the most powerful brushes in the world, zhx usually takes part in all kinds of contests.
One day, zhx takes part in an contest. He found the contest very easy for him.
There are  n  problems in the contest. He knows that he can solve the  ith  problem in  ti  units of time and he can get  vi  points.
As he is too powerful, the administrator is watching him. If he finishes the  ith  problem before time  li , he will be considered to cheat.
zhx doesn't really want to solve all these boring problems. He only wants to get no less than  w  points. You are supposed to tell him the minimal time he needs to spend while not being considered to cheat, or he is not able to get enough points. 
Note that zhx can solve only one problem at the same time. And if he starts, he would keep working on it until it is solved. And then he submits his code in no time.

 

Input

Multiply test cases(less than  50 ). Seek  EOF  as the end of the file.
For each test, there are two integers  n  and  w  separated by a space. ( 1≤n≤30 ,  0≤w≤109 )
Then come n lines which contain three integers  ti,vi,li . ( 1≤ti,li≤105,1≤vi≤109 )

 

Output

For each test case, output a single line indicating the answer. If zhx is able to get enough points, output the minimal time it takes. Otherwise, output a single line saying "zhx is naive!" (Do not output quotation marks).

 

Sample Input

  
  

   
   1 3
1 4 7
3 6
4 1 8
6 8 10
1 5 2
2 7
10 4 1
10 2 3
  
  

 

Sample Output

  
  

   
   7
8
zhx is naive!
  
  

 

Source

BestCoder Round #33

 

Recommend

hujie   |   We have carefully selected several similar problems for you:   5275  5274  5273  5272  5271 

 

题目大意：

1. 有n道题i题用时ti秒，得分vi，在li时间点之前不能做出来，而且一道题不能分开几次做（一旦开始做，必须在ti时间内把它做完） 
2.           问得到w分的最小用时是多少 

ac代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define max(a,b) (a>b?a:b)
using namespace std;
int dp[300300];
struct s
{
	int t,v,l;
}b[33];
int cmp(s a,s b)
{
	return a.l-a.t<b.l-b.t;
}
int main()
{
	int n,w;
	while(scanf("%d%d",&n,&w)!=EOF)
	{
		int i,sum=0,j;
		for(i=0;i<n;i++)
		{
			int t,v,l;
			scanf("%d%d%d",&t,&v,&l);
			b[i].t=t;
			b[i].v=v;
			b[i].l=l;
			sum+=v;
		}
		sort(b,b+n,cmp);
		memset(dp,0,sizeof(dp));
		if(sum<w)
		{
			printf("zhx is naive!\n");
			continue;
		}
		for(i=0;i<n;i++)
		{
			for(j=100100;j>=max(b[i].t,b[i].l);j--)
			{
				dp[j]=max(dp[j],dp[j-b[i].t]+b[i].v);
			}
		}
		for(i=0;i<=100100;i++)
		{
			if(dp[i]>=w)
				break;
		}
		if(i<=100100)
		{
			printf("%d\n",i);
		}
		else
		{
			printf("zhx is naive!\n");
		}
	}
}