zoukankan      html  css  js  c++  java
  • 【题解】coin HDU2884 多重背包

    题目

    Coins

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

    Problem 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
    

    题意:Tony想要买一个东西,他只有n中硬币每种硬币的面值为a[i]每种硬币的数量为c[i]要买的物品价值不超过m

    输入:第一行输入n和m,第二行输入n个硬币的面值和n个硬币的数量,输入0 0结束

    输出:1到m之间有多少价格Tony可以支付

    分析

    一道多重背包

    #include<cstdio>
    #include<iostream>
    #include<cstring>
    #include<algorithm>
    #include<cmath>
    #define ll long long
    #define re register int
    #define fp(i,a,b) for(re i=a,I=b;i<=I;++i)
    #define fd(i,a,b) for(re i=a,I=b;i>=I;--i)
    #define file(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout);
    using namespace std;
    const int INF=0x7fffff;
    inline int read() {
        int x=0,w=1;
        char ch=getchar();
        while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
        if(ch=='-') w=-1,ch=getchar();
        while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-48,ch=getchar();
        return x*w;
    }
    int a[100+10],c[100+10],f[10000];
    
    void Obag(int m,int v,int w) {                                            //0-1背包 m背包的总容量、v物品的体积、w物品的价值
        for(int i=m; i>=v; i--)
            f[i]=max(f[i],f[i-v]+w);
    }
    
    void Cbag(int m,int v,int w) {                                           //完全背包 m背包的总容量、v物品的体积、w物品的价值
        for(int i=v; i<=m; i++)
            f[i]=max(f[i],f[i-v]+w);
    }
    
    void Mbag(int m,int v,int w,int num) {                                  //多重背包 m背包的总容量、v物品的体积、w物品的价值、num物品的数量
        if(v*num>=m) {
            Cbag(m,v,w);
            return ;
        }
        int k=1;
        for(k=1; k<=num; k<<=1) {
          Obag(m,k*v,k*w);
          num=num-k;
        }
        if(num)
            Obag(m,num*v,num*w);
    }
    
    int main() {
        //file("s");
        int n,m;
        n=read();
        m=read();
        while(n||m) {
            fp(i,1,n) a[i]=read();
            fp(i,1,n) c[i]=read();
            fp(i,1,m) f[i]=-INF;
            f[0]=0;
            fp(i,1,n) {
                Mbag(m,a[i],a[i],c[i]);
            }
            fp(i,1;m) if(f[i]>0) sum++;
            cout<<sum<<endl;
        }
        return 0;
    }
    
  • 相关阅读:
    原生js实现分页功能
    webpack4 前端框架基础配置实例-解决css分离图片路径问题
    Vue cli2.0 项目中使用Monaco Editor编辑器
    Vue相关开源项目库汇总
    git常用配置
    Python 2 下载与安装
    sqlmap下载与安装
    IDEA中集成gitee插件
    双系统之删除Ubuntu系统
    IntelliJ IDEA安装注册教程
  • 原文地址:https://www.cnblogs.com/bbqub/p/7710007.html
Copyright © 2011-2022 走看看