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): 14861    Accepted Submission(s): 4140

    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.
     
    Source


    题意:
            价值分别为1,2,3,4,5,6的6件物品,每件有ni件(ni<=20000),问是否能分成等价值的两份!
           较好的动态规划模板题!
    代码:
     1 #include "stdio.h"
     2 #include "string.h"
     3 #define N 120005
     4 int a[7],map[N];
     5 int sum;
     6 
     7 int MAX(int x,int y)
     8 {
     9     if(x>y) return x;
    10     return y;
    11 }
    12  
    13 void CompletePack(int cost,int weight)   //完全背包
    14 {
    15     for(int i=cost;i<=sum;i++)
    16         map[i] = MAX(map[i],map[i-cost]+weight);
    17 }
    18 
    19 void ZeroOnePack(int cost,int weight)    // 01背包
    20 {
    21     for(int i=sum;i>=cost;i--)
    22         map[i] = MAX(map[i],map[i-cost] + weight);
    23 }
    24 
    25 void dp(int cost,int weight,int k)
    26 {
    27     if(cost*k>=sum)
    28         CompletePack(cost,weight);
    29     else
    30     {
    31         for(int j=1;j<k; )   //二进制优化 
    32         {
    33             ZeroOnePack(j*cost,j*weight);
    34             k-=j;
    35             j*=2;
    36         }
    37         ZeroOnePack(k*cost,k*weight);
    38     }
    39 }
    40 
    41 int main()
    42 {
    43     int i,p=1;
    44     while(1)
    45     {
    46         sum=0;
    47         for(i=1;i<=6;i++)
    48         {
    49             scanf("%d",&a[i]);
    50             sum+=a[i]*i;
    51         }
    52         if(sum==0) return 0;
    53         printf("Collection #%d:
    ",p++);
    54         if(sum%2==1)
    55         {
    56             printf("Can't be divided.
    
    ");
    57             continue;
    58         }
    59         sum=sum/2;
    60         memset(map,0,sizeof(map));
    61         for(i=1;i<=6;i++)
    62             dp(i,i,a[i]);
    63         if(map[sum]==sum)
    64             printf("Can be divided.
    
    ");
    65         else
    66             printf("Can't be divided.
    
    ");    
    67     }
    68     return 0;
    69 }


     
  • 相关阅读:
    Jenkins 构建后生成的HTML报告,无法导入js/css文件问题
    持续集成:API自动化 + Jenkins定时构建
    Jenkins 的安装与基础配置
    浏览器兼容性测试
    测试过程中bug缺陷的定义、bug类型、bug等级、bug生命周期、bug管理流程、bug状态处理
    常用四种用例设计方法
    软件测试工作流程图、软件测试的基本流程、软件开发流程、测试流程梳理
    软件的生命周期:瀑布型、V模型、敏捷开发模型生命周期;软件测试各阶段工作内容
    软件测试的分类、软件测试分类的说明、软件测试常见的误区
    java应用cpu使用率过高问题排查
  • 原文地址:https://www.cnblogs.com/ruo-yu/p/4411983.html
Copyright © 2011-2022 走看看