【题解】poj1742 Coins 多重背包+贪心

题目链接

Description

People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box 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

---

若前 $i$ 种硬币能拼成面值 $j$，只有两类可能情况：
$1.$ 前 $i-1$ 种硬币就能拼成面值 $j$，即在第 $i$ 阶段开始前，变量 $F[j]$ 已经成为 $true$ 。
$2.$ 使用了第 $i$ 种硬币，即在第 $i$ 阶段的递推中，发现 $F[j-a[i]]$ 为 $true$。
设 $used[j]$ 表示 $F[j]$ 在阶段 $i$ 时为 $true$ 至少需要用多少枚第 $i$ 种硬币。

#include<cstdio>
#include<cstring>
const int N=110,M=1e5+10;
int n,m,a[N],used[M],c[N],cnt;
bool f[M];
int main()
{
	//freopen("in.txt","r",stdin);
    while(scanf("%d%d",&n,&m)&&n&&m)
    {
    	memset(f,false,sizeof(f));
    	for(int i=1;i<=n;i++)
    	    scanf("%d",&a[i]);
    	for(int i=1;i<=n;i++)
    	    scanf("%d",&c[i]);
    	f[0]=true;
    	for(int i=1;i<=n;i++)
    	{
    		memset(used,0,sizeof(used));
    		for(int j=a[i];j<=m;j++)
    		    if(!f[j]&&f[j-a[i]]&&used[j-a[i]]<c[i])
    		        f[j]=true,used[j]=used[j-a[i]]+1;
		}
		cnt=0;
		for(int i=1;i<=m;i++)
		    cnt+=f[i];
		printf("%d\n",cnt);
	}
	return 0;
}

总结

利用贪心策略优化时间复杂度。