Divideing Jewels
-
描述
-
Mary and Rose own a collection of jewells. They want to split the collection among themselves so that both receive an equal share of the jewels. This would be easy if all the jewels had the same value, because then they could just split the collection in half. But unfortunately, some of the jewels are larger, or more beautiful than others. So, Mary and Rose start by assigning a value, a natural number between one and ten, to each jewel. Now they want to divide the jewels so that each of them gets the same total value. Unfortunately, they realize that it might be impossible to divide the jewels in this way (even if the total value of all jewels is even). For example, if there are one jewel 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 jewels.
-
输入
-
Each line in the input file describes one collection of jewels to be divided. The lines contain ten non-negative integers n1 , . . . , n10 , where ni is the number of jewels of value i. The maximum total number of jewells will be 10000.
The last line of the input file will be "0 0 0 0 0 0 0 0 0 0"; do not process this line.
输出
-
For each collection, output "#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.
样例输入
-
1 0 1 2 0 0 0 0 2 0
-
1 0 0 0 1 1 0 0 0 0
-
0 0 0 0 0 0 0 0 0 0
样例输出
-
#1:Can't be divided.
-
#2:Can be divided.
-
Each line in the input file describes one collection of jewels to be divided. The lines contain ten non-negative integers n1 , . . . , n10 , where ni is the number of jewels of value i. The maximum total number of jewells will be 10000.
题目大意:有一堆珠宝,价值分别为1-10的整数,给出没中价值的珠宝的个数,问能不能将这些珠宝恰好平均分成两份!
分析:将每种物品打包成1,2,4...s件的合体。这是二进制的思想,因为任何几件相同物品都可以由打包后的组合而成,其中s等于f[i]-(1+2+4...2^k),即除了打包还剩下的个数。 比如f[1]=13,则可以打包成1,2,4,6件的合体来按照0-1背包做!
代码:
#include<stdio.h> #include<stdlib.h> #define N 50000 int dp[N],f[11]; int main(){ int i,j,k,flag,sum,T=1,s; while(1) { for(i=1,sum=0;i<=10;i++){ scanf("%d",&f[i]);//每种商品的个数 sum=sum+f[i]*i; } if(sum==0) break; if(sum%2==1) { printf("#%d:Can't be divided.\n",T++); continue; } for(i=1,dp[0]=0,sum/=2;i<=sum;i++) dp[i]=-0x7FFFFFFF; for(i=1;i<=10;i++){ for(j=sum;j>=i;j--) { for(k=1,s=0;k<=f[i]&&j>=k*i;k*=2) { dp[j]=dp[j-k*i]+k*i>dp[j]?dp[j-k*i]+k*i:dp[j]; s+=k; } k=f[i]-s; if(j>k*i) dp[j]=dp[j-k*i]+k*i>dp[j]?dp[j-k*i]+k*i:dp[j]; } } if(dp[sum]<0) printf("#%d:Can't be divided.\n\n",T++); else printf("#%d:Can be divided.\n\n",T++); } system("pause"); return 0; }