Poj 1742(男人八题——dp)

Coins
Time Limit: 3000MS Memory Limit: 30000K
Total Submissions: 25745 Accepted: 8717

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

Source


这题就是书上多重部分和问题的另一种问法。用dp[i][j]表示用前i种数得到j,剩下的i物品最多的个数。这样如果前i-1种数加和能得到j的话,第i种数就可以留下c[i]个。此外前i种数加和出j-a[i]时第i种数还剩下k(k>0)的话,用这i种数加和j时第i种数就能剩下k-1个。具体的递推式见代码。因为这题内存给的不大,所以要用滚动数组。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>
#include<stack>
using namespace std;
const int maxn = 100 + 5;
const int maxm = 100000 + 5;
const int INF = 2000000000;
const int Mod = 1000000000;
typedef pair<int,int> P;
typedef long long LL;

int dp[2][maxm];
int a[maxn],c[maxn];
int vis[maxm];

int main(){
    int n,m;
    while(scanf("%d%d",&n,&m)){
        if(n == 0 && m == 0) break;
        for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
        for(int i = 1;i <= n;i++) scanf("%d",&c[i]);
        memset(dp,-1,sizeof(dp));
        memset(vis,0,sizeof(vis));
        dp[0][0] = 0;
        for(int i = 1;i <= n;i++){
            for(int j = 0;j <= m;j++){
                if(dp[(i+1)&1][j] >= 0) dp[i&1][j] = c[i];
                else if(j < a[i] || dp[i&1][j-a[i]] <= 0) dp[i&1][j] = -1;
                else dp[i&1][j] = dp[i&1][j-a[i]]-1;
                if(dp[i&1][j] != -1) vis[j] = 1;
            }
        }
        int ans = 0;
        for(int i = 1;i <= m;i++){
            if(vis[i] == 1) ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值