zoukankan      html  css  js  c++  java
  • HDOJ 2844 Coins

    特殊的多重背包

    Coins

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


    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
     

    Source
     

    Recommend
    gaojie
     

    #include <iostream>
    #include <cstring>

    using namespace std;

    int V;
    int dp[100010];
    int c[111],m[111];

    void zpack(int* a,int c,int w)
    {
        for(int i=V;i>=c;i--)
            a=max(a,a[i-c]+w);
    }

    void cpack(int * a,int c,int w)
    {
        for(int i=c;i<=V;i++)
            a=max(a,a[i-c]+w);
    }

    void multipack(int *a,int c,int w,int m)
    {
        if(c*m>=V)
        {
            cpack(a,c,w);
            return ;
        }
        int k=1;
        while(k<m)
        {
            zpack(a,c*k,w*k);
            m-=k;
            k*=2;
        }

        zpack(a,m*c,m*w);
    }

    int main()
    {
    int N;
    while(cin>>N>>V&&(N||V))
    {
        for(int i=0;i<N;i++)
            cin>>c;
        for(int i=0;i<N;i++)
            cin>>m;

        memset(dp,0,sizeof(dp));
        for(int i=0;i<N;i++)
            multipack(dp,c,c,m);

        int ans=0;
        for(int i=1;i<=V;i++)
            if(dp==i) ans++;
        cout<<ans<<endl;
    }

        return 0;
    }

  • 相关阅读:
    Medium | LeetCode 142. 环形链表 II
    Easy | LeetCode 141. 环形链表
    Hard | LeetCode 23. 合并K个升序链表 | 分治 | 优先队列
    std(19)内置算法find find_if
    stl(18)内置算法for_each transform
    C++引用和指针比较 指针常量和常量指针
    #pragma once和#ifndef用法
    c++变量的一些注意点 extern关键字的使用
    比特 字节 地址 类型 编码 32位 64位
    stl(16)stl内置的一些函数对象
  • 原文地址:https://www.cnblogs.com/CKboss/p/3351050.html
Copyright © 2011-2022 走看看