HDU2844 Coins(多重背包)

HDU2844 Coins(多重背包)

Description
Whuacmers use coins.They have coins of value A1,A2,A3…An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.
Input
The input contains several test cases. The first line of each test case contains two integers n(1 ≤ n ≤ 100),m(m ≤ 100000).The second line contains 2n integers, denoting A1,A2,A3…An,C1,C2,C3…Cn (1 ≤ Ai ≤ 100000,1 ≤ Ci ≤ 1000). The last test case is followed by two zeros.
Output
For each test case output the answer on a single line.
Sample Input
3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0
Sample Output
8
4

题意

多重背包模板题,利用了二进制优化。

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<vector>
#include<functional> 
#include<map>
#include<unordered_map>
using namespace std;
typedef long long ll;
const int N=1e6+10,NN=1e3+10,INF=0x3f3f3f3f;
const ll MOD=1e9+7;
int n,m;
int a[N],c[N],dp[N];
void init(){
	memset(dp,0,sizeof dp);
}
int main(){
    while(scanf("%d%d",&n,&m)&&n+m){
    	init();
    	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    	for(int i=1;i<=n;i++) scanf("%d",&c[i]);
    	for(int i=1;i<=n;i++){
    		for(int k=1;c[i];k=k*2){//二进制优化
    			k=min(k,c[i]);
    			c[i]-=k;
    			for(int j=m;j>=k*a[i];j--) dp[j]=max(dp[j],dp[j-k*a[i]]+k*a[i]);
			}
		}
		int sum=0;
		for(int i=1;i<=m;i++) if(dp[i]==i) ++sum;//题目要求的是这些金币能凑出几种金额 
		printf("%d\n",sum);
	}
}
©️2020 CSDN 皮肤主题: 1024 设计师:上身试试 返回首页