HDU-1059-Dividing-wust9(背包)
来源:互联网 发布:网络投影仪 编辑:程序博客网 时间:2024/06/10 12:50
Problem E
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 21 Accepted Submission(s) : 6
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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.
#include<iostream>#include<cstdio>using namespace std;const int MAXN=2000+5;const int MAXC=120000+5;int v[MAXN];int w[MAXN];int f[MAXC];int size[7];void dp(int n,int c){int i,j;memset(f,0,sizeof(f));for(i=1;i<=n;i++)for(j=c;j>=v[i];j--)if(f[j]<f[j-v[i]]+w[i])f[j]=f[j-v[i]]+w[i];}int main(){int c,i,j,k,csa=1;while(cin>>size[1]>>size[2]>>size[3]>>size[4]>>size[5]>>size[6]){for(c=0,i=1;i<=6;i++)c+=size[i]*i;if(c==0)break;if(c%2!=0){printf("Collection #%d:\nCan't be divided.\n\n",csa++);continue;}else{c/=2;for(k=0,i=1;i<=6;i++){for(j=0;(1<<j)<=size[i];j++){k++;w[k]=v[k]=i<<j;size[i]-=(1<<j);}if(size[i]>0){k++;w[k]=v[k]=i*size[i];}}dp(k,c);if(c==f[c])printf("Collection #%d:\nCan be divided.\n\n",csa++);elseprintf("Collection #%d:\nCan't be divided.\n\n",csa++);}}return 0;}
0 0
- HDU-1059-Dividing-wust9(背包)
- hdu 2191-wust9(多重背包典型)
- hdu 1059 Dividing 背包
- HDU 1864:最大报销额-wust9(背包,数据放大)
- 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(多重背包)
- ubuntukylin14.04+KDE多显示器配置问题
- 一、线程的学习
- Android利用tcpdump和wireshark抓取网络数据包
- xcode5.0 设置静态库头文件
- mysql导入数据时提示 USING BTREE 错误解决办法
- HDU-1059-Dividing-wust9(背包)
- Spring注解详解
- Leetcode: Search in Rotate Sorted Array II 理解分析
- distutils.errors.DistutilsError: Setup script exited with error: Unable to find vcvarsall.bat
- google asr api
- C++学习笔记(3)
- VS2010+Opencv-2.4.9的配置攻略
- Android公共库——图片缓存 网络缓存 下拉及底部更多ListView 公共类
- NYOJ 56 阶乘因式分解(一)