zoukankan      html  css  js  c++  java
  • POJ 1276 Cash Machine

    Cash Machine

    Time Limit: 1000ms
    Memory Limit: 10000KB
    This problem will be judged on PKU. Original ID: 1276
    64-bit integer IO format: %lld      Java class name: Main
    A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example, 

    N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10 

    means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each. 

    Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine. 

    Notes: 
    @ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc. 
     

    Input

    The program input is from standard input. Each data set in the input stands for a particular transaction and has the format: 

    cash N n1 D1 n2 D2 ... nN DN 

    where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct. 
     

    Output

    For each set of data the program prints the result to the standard output on a separate line as shown in the examples below. 
     

    Sample Input

    735 3  4 125  6 5  3 350
    633 4  500 30  6 100  1 5  0 1
    735 0
    0 3  10 100  10 50  10 10

    Sample Output

    735
    630
    0
    0

    Hint

    The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash. 

    In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash. 

    In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.
     

    Source

     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cmath>
     5 #include <vector>
     6 using namespace std;
     7 const int maxn = 100010;
     8 int dp[maxn],val[maxn],num[maxn],n,m;
     9 int main() {
    10     while(~scanf("%d %d",&n,&m)) {
    11         for(int i = 0; i < m; ++i)
    12             scanf("%d %d",num+i,val+i);
    13         memset(dp,0,sizeof dp);
    14         for(int i = 0; i < m; ++i) {
    15             int cnt = 1;
    16             while(num[i]){
    17                 if(cnt > num[i]) cnt = num[i];
    18                 num[i] -= cnt;
    19                 for(int j = n; j >= cnt*val[i]; --j)
    20                     dp[j] = max(dp[j],dp[j-cnt*val[i]]+cnt*val[i]);
    21                 cnt <<= 1;
    22             }
    23         }
    24         printf("%d
    ",dp[n]);
    25     }
    26     return 0;
    27 }
    View Code
    解题:多重背包
     
     也可以用完全背包做,只要进行约束就是了
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cmath>
     5 #include <vector>
     6 using namespace std;
     7 const int maxn = 100010;
     8 int dp[maxn],val[maxn],num[maxn],cnt[maxn],n,m;
     9 int main() {
    10     while(~scanf("%d %d",&n,&m)) {
    11         for(int i = 0; i < m; ++i)
    12             scanf("%d %d",num+i,val+i);
    13         memset(dp,0,sizeof dp);
    14         for(int i = 0; i < m; ++i) {
    15             memset(cnt,0,sizeof cnt);
    16             for(int j = val[i]; j <= n; ++j)
    17             if(dp[j - val[i]] + val[i]> dp[j] && cnt[j-val[i]] < num[i]){
    18                 dp[j] = dp[j-val[i]]+val[i];
    19                 cnt[j] = cnt[j-val[i]] + 1;
    20             }
    21         }
    22         printf("%d
    ",dp[n]);
    23     }
    24     return 0;
    25 }
    View Code
  • 相关阅读:
    SQLPrompt 7.2发布
    安装SQL Server2016正式版
    Coping with the TCP TIME-WAIT state on busy Linux servers
    分区里的inode号是0号和1号的block
    如何知道SQL Server机器上有多少个NUMA节点
    使用开源软件的原因
    一起来测试天兔Lepus3.8 Beta版本的MSSQL部分
    新书到手 TRANSACTION PROCESSING:CONCEPTS AND TECHNIQUES
    在线即时展现 Html、JS、CSS 编辑工具
    在触屏设备上面利用html5裁剪图片
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4442542.html
Copyright © 2011-2022 走看看