HDU 1059 Dividing(多重背包)
来源:互联网 发布:三星手表gears软件 编辑:程序博客网 时间:2024/06/08 03:42
Dividing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27920 Accepted Submission(s): 8033
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.
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.
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.
Output a blank line after each test case.
Sample Input
1 0 1 2 0 01 0 0 0 1 10 0 0 0 0 0
Sample Output
Collection #1:Can't be divided.Collection #2:Can be divided.
Source
Mid-Central European Regional Contest 1999
使用二进制优化
代码:
#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;#define maxn 100int v[maxn],dp[120005],n[10];int w(int m,int co,int index){ int i; for(i=1;i<=m;i*=2) { v[index++]=i*co; m-=i; } if(m>0) v[index++]=m*co; return index;}int main(){ int i,j,cnt=0; while(~scanf("%d%d%d%d%d%d",&n[1],&n[2],&n[3],&n[4],&n[5],&n[6]),n[1]+n[2]+n[3]+n[4]+n[5]+n[6]) { int index=0; printf("Collection #%d:\n",++cnt); memset(dp,0,sizeof(dp)); dp[0]=0; int sum=(n[1]+n[2]*2+n[3]*3+n[4]*4+n[5]*5+n[6]*6); if(sum%2==0) { sum/=2; for(i=1;i<7;i++) index=w(n[i],i,index); for(i=0;i<index;i++) { for(j=sum;j>=v[i];j--) { dp[j]=max(v[i]+dp[j-v[i]],dp[j]); } } if(dp[sum]!=sum)printf("Can't be divided.\n\n"); else printf("Can be divided.\n\n"); } else printf("Can't be divided.\n\n"); } return 0;}
阅读全文
0 0
- hdu 1059 Dividing 多重背包
- hdu 1059 Dividing(多重背包)
- hdu 1059 Dividing(多重背包)
- HDU 1059 Dividing(多重背包)
- hdu 1059 Dividing 多重背包
- Hdu 1059 Dividing -- 多重背包
- hdu 1059 Dividing 多重背包
- HDU-1059-Dividing-多重背包
- HDU-1059 Dividing 多重背包
- hdu 1059 Dividing (多重背包)
- HDU 1059 Dividing 多重背包
- Hdu 1059 Dividing (多重背包)
- HDU 1059 Dividing 多重背包
- hdu-1059-多重背包-Dividing
- HDU 1059 Dividing 多重背包
- HDU 1059 Dividing(多重背包)
- 【多重背包】HDU 1059 Dividing
- hdu 1059 Dividing 多重背包
- 定义类
- [ArcGIS] 模型构造器中使用重分类 ArcPy与Numpy 相等间隔重分类
- HTML实现位置感知
- Piggy-Bank (完全背包)
- STM32上SPI+DMA实现大批量读取flash数据
- HDU 1059 Dividing(多重背包)
- 1138: C语言合法标识符
- C++引用
- androidstudio更换svn地址方法
- 从订单信息页面进入订单详细商品页面,最简单的MVC思想
- 设置RecyclerView的位置(点击回到顶部)
- 继承TextView实现自定义动态文字闪动效果
- springmvc 参数绑定注解详解
- C++ 二维数组