hdu1059Dividing【多重背包】
来源:互联网 发布:c httppost json数据 编辑:程序博客网 时间:2024/06/05 11:40
Dividing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21171 Accepted Submission(s): 5975
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 欧洲为啥题都这么简单==
又是问能不能均分==都做了多少遍了(⊙﹏⊙)b
你们猜这次我卡哪了??zero和complete调用位置写反了T^T输出了那么多中间变量才发现!!
RE一次又是因为没审题!数组开小了!你错多少次能记住??
居然是踩线过的==
/**************hdu10592015.11.3717MS 1908K 2084 B G++**************/#include <iostream>#include<cstdio>#include<cstring>using namespace std;int dp[90000],value[10],cost[10],num[10],v;void zeropack(int cost,int value){ for(int i=v;i>=cost;i--) dp[i]=max(dp[i],dp[i-cost]+value); // printf("zero ");}void complete(int cost,int value){ for(int i=cost;i<=v;i++) dp[i]=max(dp[i],dp[i-cost]+value); //printf("complete ");}void multipack(int cost,int value,int num){ if(num==0) return; if(cost*num>=v) { complete(cost,value); return; } int k=1; while(k<num) { zeropack(k*cost,k*value); num-=k; k*=2; } zeropack(num*cost,num*value);}int main(){ //freopen("cin.txt","r",stdin); int cnt=1; while(~scanf("%d%d%d%d%d%d",&num[1],&num[2],&num[3],&num[4],&num[5],&num[6])) { for(int i=1;i<=6;i++) value[i]=i; for(int i=1;i<=6;i++) cost[i]=i; if(num[1]==0&&num[2]==0&&num[3]==0&&num[4]==0&&num[5]==0&&num[6]==0) break; v=num[1]+num[2]*2+num[3]*3+num[4]*4+num[5]*5+num[6]*6; //for(int i=1;i<=6;i++) if(!num[i]) {value[i]=0;cost[i]=0;} //for(int i=1;i<=6;i++) printf("%d ",num[i]); if(v&1) { printf("Collection #%d:\nCan't be divided.\n\n",cnt++); continue; } v/=2; memset(dp,0,sizeof(dp)); for(int i=1;i<=6;i++) { if(num[i]==0) continue; //printf("i=%d ",i); multipack(cost[i],value[i],num[i]); // printf("i=%d ",i); // for(int j=cost[i];j<=v;j++)printf("i=%d j=%d dp[j]=%d ",i,j,dp[j]); // printf("\n"); } //printf("%d\n",dp[v]); // for(int i=1;i<=6;i++) printf("%d ",dp[i]); if(dp[v]!=v) printf("Collection #%d:\nCan't be divided.\n\n",cnt++); else printf("Collection #%d:\nCan be divided.\n\n",cnt++); } return 0;}
0 0
- hdu1059dividing 多重背包
- 【多重背包】HDU1059Dividing
- hdu1059Dividing【多重背包】
- hdu1059Dividing 多重背包二进制优化
- HDU1059Dividing 二进制优化多重背包
- hdu1059Dividing(多重背包问题(模板)做的第一道背包题)
- HDU1059Dividing
- 多重背包
- 多重背包
- 多重背包
- 多重背包
- 多重背包
- 多重背包
- 多重背包
- 多重背包
- 多重背包
- 多重背包
- 【多重背包】
- GIT用法
- BCB中的TBitBtn和TSpeedButton(透明按钮)
- 《C++ primer》英文第五版阅读笔记(九)——string(字符串)类型
- ios中的各种控件(Swift开发实战权威指南笔记)
- U大师U盘装系统——苹果电脑安装WIN7系统图解法
- hdu1059Dividing【多重背包】
- Socket 通信原理(Android客户端和服务器以TCP&&UDP方式互通)
- RS485接口自动换向电路仿真
- 【HDOJ】【1021】Fibonacci Again
- 模板方法模式深度解析(三)
- linux中shell命令执行的判断依据 &&,||, (),{}
- OSCache-缓存对象
- 字符串指针与字符数组的区别
- C# 匿名类型的基本特征