zoukankan      html  css  js  c++  java
  • HDU-1059 Dividing (多重背包)

    题目:

    Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value.
    Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.

    Input

    Each line in the input describes one collection of marbles to be divided. The lines consist of six non-negative integers n1, n2, …, n6, where ni is the number of marbles of value i. So, the example from above would be described by the input-line 1 0 1 2 0 0''. The maximum total number of marbles will be 20000.
    The last line of the input file will be
    0 0 0 0 0 0”; do not process this line.

    Output

    For each colletcion, output Collection #k:'', where k is the number of the test case, and then either“Can be divided.” or “Can’t be divided.”.
    Output a blank line after each test case.

    Sample Input

    1 0 1 2 0 0
    1 0 0 0 1 1
    0 0 0 0 0 0

    Sample Output

    Collection #1:
    Can’t be divided.

    Collection #2:
    Can be divided.


    Code:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 #define M(a, b) memset(a, b, sizeof(a))
     4 int dp[100000], maxn;
     5 
     6 void ZeroOnePack(int cost, int weight){
     7     for (int i = maxn; i >= cost; --i)
     8         dp[i] = max(dp[i-cost]+weight, dp[i]);
     9 }
    10 
    11 void CompletePack(int cost, int weight){
    12     for (int i = cost; i <= maxn; ++i)
    13         dp[i] = max(dp[i-cost]+weight, dp[i]);
    14 }
    15 
    16 void MultiplePack(int cost, int weight, int amount){
    17     if (cost*amount >= maxn) CompletePack(cost, weight);
    18     else{
    19         for (int i = 1; i <= amount; amount-=i, i <<= 1)
    20             ZeroOnePack(i*cost, i*weight);
    21         ZeroOnePack(amount*cost, amount*weight);
    22     }
    23 }
    24 
    25 int main()
    26 {
    27     int cnt[7], kase = 0;
    28     while(++kase){
    29         if(kase > 1) cout<<endl;
    30         M(dp, 0);
    31         maxn = 0;
    32         bool key = 1;
    33         for (int i = 1; i <= 6; ++i){
    34             cin>>cnt[i];
    35             maxn += cnt[i]*i;
    36             if (cnt[i]) key = 0;
    37         }
    38         if (key) break;
    39         bool flag = 0;
    40         if (maxn % 2 == 0){
    41             maxn /= 2;
    42             for (int i = 1; i <= 6; ++i)
    43                 MultiplePack(i, i, cnt[i]);
    44             if (dp[maxn] == maxn) flag = true;
    45         }
    46         cout<<"Collection #"<<kase<<":"<<endl;
    47         if (flag) cout<<"Can be divided."<<endl;
    48         else cout<<"Can't be divided."<<endl;
    49     }
    50 
    51     return 0;
    52 }
  • 相关阅读:
    使用FastJson parseObject方法时,json字符串解析成对象后,部分属性丢失问题处理
    IDEA启动Tomcat时 , 报错提示:this web application instance has been stopped already
    Servlet基本概念记录(随笔...不完全...)
    有关MacBook的简单操作收集
    Elasticsearch 相关资料收集
    redis入门
    整理最近面试遇到的一些问题
    java中的一些概念整理
    windows相关操作
    java基础知识优秀博客整理
  • 原文地址:https://www.cnblogs.com/robin1998/p/6359126.html
Copyright © 2011-2022 走看看