zoukankan      html  css  js  c++  java
  • [HDU 1059] Dividing

    Dividing

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 17581    Accepted Submission(s): 4928


    Problem Description
    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.
     
    题意:有6种石头,价值1~6,已知石头的个数,问能够平分成等价值两份。
    多重背包、、上代码
    #include <iostream>
    #include <cstring>
    using namespace std;
    #define max(a,b) ((a)>(b)?(a):(b))
    #define N 40010
    
    int a[7];
    int w[N];
    int dp[N];
    
    int main()
    {
        int i,j,n,sum,s,iCase=0;
        while(scanf("%d%d%d%d%d%d",&a[1],&a[2],&a[3],&a[4],&a[5],&a[6])!=EOF)
        {
            n=sum=0;
            for(i=1;i<=6;i++)
            {
                sum+=a[i]*i;
                j=1;
                while(j<a[i])
                {
                    w[++n]=i*j;
                    a[i]-=j;
                    j<<=1;
                }
                w[++n]=i*a[i];
            }
            if(sum==0) break;
            if(sum%2==0)  //奇数,不可能平分
            {
                s=sum/2;
                memset(dp,-1000000,sizeof(dp));
                dp[0]=0;
                for(i=1;i<=n;i++)
                {
                    for(j=s;j>=w[i];j--)
                    {
                        dp[j]=max(dp[j],dp[j-w[i]]+w[i]);
                    }
                }
            }
            printf("Collection #%d:
    ",++iCase);
            if(dp[s]==s)
                printf("Can be divided.
    
    ");
            else
                printf("Can't be divided.
    
    ");
        }
        return 0;
    }
    趁着还有梦想、将AC进行到底~~~by 452181625
  • 相关阅读:
    Hybris Commerce下单时遇到产品库存不足的解决办法
    浅谈SAP CRM和Hybris Commerce里的价格架构折扣
    使用Fiddler为满足某些特定格式的网络请求返回mock响应
    如何设置Fiddler来拦截Java代码发送的HTTP请求,进行各种问题排查
    服务人员在Hybris ASM手动分配coupon给某个客户
    亲爱的SAP从业者们,烦请做个SAP知识学习种类的小调查
    使用Hybris Commerce User API读取用户信息时,电话字段没有返回
    Hybris commerce产品主数据的搜索API,批量返回若干主数据的值
    PCA
    SIFT+HOG+鲁棒统计+RANSAC
  • 原文地址:https://www.cnblogs.com/hate13/p/4061999.html
Copyright © 2011-2022 走看看