hdu3732 Ahui Writes Word（多重背包）经典

Ahui Writes Word

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1075    Accepted Submission(s): 406

Problem Description

We all know that English is very important, so Ahui strive for this in order to learn more English words. To know that word has its value and complexity of writing (the length of each word does not exceed 10 by only lowercase letters), Ahui wrote the complexity of the total is less than or equal to C.
Question: the maximum value Ahui can get.
Note: input words will not be the same.

 

Input

The first line of each test case are two integer N , C, representing the number of Ahui’s words and the total complexity of written words. (1 ≤ N ≤ 100000, 1 ≤ C ≤ 10000)
Each of the next N line are a string and two integer, representing the word, the value(Vi ) and the complexity(Ci ). (0 ≤ Vi , Ci ≤ 10)

 

 

Output

Output the maximum value in a single line for each test case.

 

 

Sample Input

5 20

go 5 8

think 3 7

big 7 4

read 2 6

write 3 5

 

Sample Output

15

Hint

Input data is huge,please use “scanf(“%s”,s)”

 

Author

Ahui

 

Source

ACMDIY第二届群赛

 

Recommend

notonlysuccess

 

题意：Ahui学习英语单词，每个单词都是不同的，并且都有自身的价值量 w 和难度值 c （0<=w,c<=10），Ahui 现在给定总单词个数 N 和可以总难度值 V，求最大的价值。

分析：由于N*V=10^9  01背包肯定超时，可是看看 w、c 的范围，重复的很多，转换一下多重背包。

心得：要懂得转换呀！！！

 

View Code

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #define MAXN 11
 5 #define MAXV 10001
 6 
 7 using namespace std;
 8 
 9 int cnt[MAXN][MAXN],d[MAXV],V;
10 char s[15];
11 
12 void ZeroOnePack(int cost,int weight)
13 {
14     int i;
15     for(i=V;i>=cost;i--)
16         d[i]=max(d[i],d[i-cost]+weight);
17 }
18 
19 void CompletPack(int cost,int weight)
20 {
21     int i;
22     for(i=cost;i<=V;i++)
23         d[i]=max(d[i],d[i-cost]+weight);
24 }
25 
26 void MultPack(int cost,int weight,int n)
27 {
28     if(cost*n>=V)
29         CompletPack(cost,weight);
30     int k;
31     k=1;
32     while(k<=n)
33     {
34         ZeroOnePack(k*cost,k*weight);
35         n=n-k;
36         k=k*2;
37     }
38     if(n)
39         ZeroOnePack(n*cost,n*weight);
40 }
41 
42 int main()
43 {
44     int N,i,a,b;
45     while(scanf("%d %d",&N,&V)==2)
46     {
47         memset(cnt,0,sizeof(cnt));
48         memset(d,0,sizeof(d));
49         for(i=0;i<N;i++)
50         {
51             scanf("%s %d %d",s,&b,&a);
52             cnt[a][b]++;
53         }
54         for(a=0;a<MAXN;a++)
55             for(b=0;b<MAXN;b++)
56                 if(cnt[a][b])
57                     MultPack(a,b,cnt[a][b]);
58         printf("%d\n",d[V]);
59     }
60     return 0;
61 }

 

转载于:https://www.cnblogs.com/zhourongqing/archive/2012/08/23/2653295.html