Dividing(多重背包+二进制优化)
来源:互联网 发布:郑州学软件 编辑:程序博客网 时间:2024/06/09 15:22
Dividing
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 63688 Accepted: 16498
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 file describes one collection of marbles to be divided. The lines contain six non-negative integers n1 , . . . , 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 collection, 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 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
Mid-Central European Regional Contest 1999
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;int num[7],dp[120000];int main(){ int i,j,k,sum,sum1,tmp,flag=1; while(cin>>num[1]) { memset(dp,0,sizeof(dp)); dp[0]=1; sum=num[1]; for(i=2;i<=6;i++) { cin>>num[i]; sum+=num[i]*i; } if(sum==0) { break; } else { if(flag!=1) { cout<<endl; } if(sum&1) { printf("Collection #%d:\nCan't be divided.\n",flag); } else { //cout<<sum<<endl; sum1=sum/2; for(i=1;i<=6;i++) { if(!num[i]) { continue; } for(j=1;j<=num[i];j*=2) { tmp=j*i; for(k=sum1;k>=tmp;k--) { if(dp[k-tmp]) { dp[k]=1; } } num[i]-=j; } tmp=num[i]*i; if(tmp) { for(k=sum1;k>=tmp;k--) { if(dp[k-tmp]) { dp[k]=1; } } } } if(dp[sum1]) { printf("Collection #%d:\nCan be divided.\n",flag); } else { printf("Collection #%d:\nCan't be divided.\n",flag); } } flag++; } }}
0 0
- Dividing(多重背包+二进制优化)
- poj1014 dividing(多重背包+二进制优化)
- HDU Dividing (多重背包+二进制优化)
- HDU 1059 Dividing (多重背包+二进制优化)
- hdu 1059 Dividing 多重背包,二进制优化
- HDU 1059 Dividing 多重背包二进制优化
- POJ 1014 Dividing(二进制优化+多重背包)
- hdu1059 Dividing(多重背包+二进制优化)
- hdu1059 Dividing(多重背包+二进制优化)
- #POJ1014#Dividing(多重背包二进制优化)
- HDU1059:Dividing(多重背包二进制优化)
- HDU1059-Dividing(多重背包+二进制优化)
- hdu1059 Dividing(多重背包二进制优化)
- poj1014 Dividing(多重背包的二进制优化)
- POJ 1014 Dividing(多重背包 + 二进制优化 + 01背包)
- HDOJ 1059 Dividing (多重背包二进制优化转01背包)
- poj1014+hdu1059--A - Dividing(多重背包,二进制优化)
- POJ 1014 Dividing 【DP 之 多重背包 / 二进制优化】
- Byte KB MB GB的转换关系
- HDU 3251 Being a Hero(最小割)经典
- 黑马程序员——java基础_数组
- Hibernate学习(2)入门案例
- 英文Ubuntu下安装搜狗拼音
- Dividing(多重背包+二进制优化)
- Java实现多线程的三种方式
- 三向切分快速排序
- 复选框的存储信息和回显
- 【练习笔记】剑指offer-变态跳台阶
- Spring+Struts+Hibernate+Mysql
- 黑马程序员——java基础_封装、构造函数
- IP地址的规划和设计方法(三)
- Android 属性动画总小结