Dividing-多重背包模板题
2015-07-28 16:33
218 查看
Dividing
Submit Status
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
Sample Output
原理,大家可以通过看背包九讲,我不认为自己比那大牛牛逼
所以我只能提供两种不同风格的代码给大家认识一下:
当然着下面的代码还可以更加优化,让它更加贴近题目的意思,优化代码在下代码的下面
Time Limit: 1000MS | Memory Limit: 32768KB | 64bit IO Format: %I64d & %I64u |
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.
原理,大家可以通过看背包九讲,我不认为自己比那大牛牛逼
所以我只能提供两种不同风格的代码给大家认识一下:
/* Author: 2486 Memory: 1152 KB Time: 0 MS Language: G++ Result: Accepted */ #include <cstdio> #include <cstring> #include <string> #include <algorithm> #include <iostream> using namespace std; const int maxn=20005; int f[maxn<<2],v[maxn],w[maxn],n[maxn]; int a[6],mid; void zeroonepack(int w,int v) { for(int i=mid; i>=w; i--) { f[i]=max(f[i],f[i-w]+v); } } void completepack(int w,int v) { for(int i=w; i<=mid; i++) { f[i]=max(f[i],f[i-w]+v); } } void multipack(int w,int v,int n) { if(w*n>mid) { completepack(w,v); return ; } else { for(int k=1; k<n; k<<=1) { zeroonepack(k*w,k*v); n-=k; } zeroonepack(n*w,n*v); } } int main() { int number=1; while(~scanf("%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5])) { int sum=0; for(int i=0; i<6; i++) { sum+=a[i]*(i+1); } mid=sum>>1; for(int i=0; i<=sum; i++) { f[i]=-maxn; } f[0]=0; if(!sum)break; printf("Collection #%d:\n",number++); if(sum&1) { printf("Can't be divided.\n"); } else { for(int i=0; i<6; i++) { multipack(i+1,i+1,a[i]); } if(f[mid]==mid) { printf("Can be divided.\n"); } else { printf("Can't be divided.\n"); } } printf("\n"); } return 0; }以上是大牛的代码,与下面的原理一样,只是他巧妙的运用了现处理现递推
当然着下面的代码还可以更加优化,让它更加贴近题目的意思,优化代码在下代码的下面
Author: 2486 Memory: 3828 KB Time: 47 MS Language: G++ Result: Accepted */ #include <cstdio> #include <string> #include <iostream> #include <cstring> #include <algorithm> using namespace std; const int maxn=200005; int sizes[maxn<<2],value[maxn<<2]; int a[6]; int dp[maxn<<2]; int main() { int cas=0; while(~scanf("%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5])) { int sum=0,mid; for(int i=0; i<6; i++) { sum+=a[i]*(i+1); } if(!sum)break; printf("Collection #%d:\n",++cas); int count=0; mid=sum>>1; if(sum&1) { printf("Can't be divided.\n"); printf("\n"); continue; } for(int i=0; i<6; i++) { for(int j=1; j<=a[i]; j<<=1) { sizes[count]=j*(i+1); value[count++]=j*(i+1); a[i]-=j; } if(a[i]>0) { sizes[count]=a[i]*(i+1); value[count++]=a[i]*(i+1); } } memset(dp,0,sizeof(dp)); for(int i=0; i<count; i++) { for(int j=mid; j>=sizes[i]; j--) { dp[j]=max(dp[j],dp[j-sizes[i]]+value[i]); } } if(dp[mid]==mid) { printf("Can be divided.\n"); } else { printf("Can't be divided.\n"); } printf("\n"); } return 0; }
/* POJ Problem: 1014 User: 2486 Memory: 212K Time: 16MS Language: C++ Result: Accepted */ #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn=20000+5; int a[6],mid; bool dp[maxn<<2];//表示这个状态是否存在,这样就更加符合题目的意思 void solve(int v) { for(int j=mid; j>=v; j--) { dp[j]|=dp[j-v]; } } int main() { int t=1; while(~scanf("%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5])) { if(t!=1)printf("\n"); memset(dp,false,sizeof(dp)); int sum=0; for(int i=0; i<6; i++) { sum+=a[i]*(i+1); } if(sum==0)break; mid=sum>>1; printf("Collection #%d:\n",t++); if(sum&1) { printf("Can't be divided.\n"); continue; } dp[0]=true; for(int i=0; i<6; i++) { for(int j=1; j<=a[i]; j<<=1) { solve(j*(i+1));//运用01背包的思路,我已经将他分为一个物品,那么直接进行处理 a[i]-=j; } if(a[i])solve(a[i]*(i+1)); } printf("%s\n",dp[mid]?"Can be divided.":"Can't be divided."); } return 0; }
相关文章推荐
- SmartPaaS开放平台支撑企业实现“互联网+”
- How to Improve Communication Skills
- 经典算法题每日演练——第十四题 Prim算法
- 经典算法题每日演练——第十六题 Kruskal算法
- HDU_1312_Red and Black
- poj1664 放苹果 解题报告
- Maximum Depth of Binary Tree
- Android 自定义View 实现刮刮卡效果
- 黑马程序员——Java基础——IO(一)
- LeetCode算法题2:Add Two Numbers
- 经典算法题每日演练——第十五题 并查集
- 经典算法题每日演练——第十二题 线段树
- 经典算法题每日演练——第十三题 赫夫曼树
- nRF51822使用passkey配对
- a different object with the same identifier value was already 。。 。。 。 。 解决方法
- FusionCharts的属性及其作用
- wait waitpid
- [转]Android逆向之动态调试总结
- [题解]聪明的质检员
- 使用Javascript Ajax 通信操作JSON数据 [上]