HDU 6092 01背包变形

Rikka with Subset

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1846    Accepted Submission(s): 896

Problem Description

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

Yuta has n positive A1−An and their sum is m. Then for each subset S of A, Yuta calculates the sum of S.

Now, Yuta has got 2n numbers between [0,m]. For each i∈[0,m], he counts the number of is he got as Bi.

Yuta shows Rikka the array Bi and he wants Rikka to restore A1−An.

It is too difficult for Rikka. Can you help her?

 

Input

The first line contains a number t(1≤t≤70), the number of the testcases.

For each testcase, the first line contains two numbers n,m(1≤n≤50,1≤m≤104).

The second line contains m+1 numbers B0−Bm(0≤Bi≤2n).

 

Output

For each testcase, print a single line with n numbers A1−An.

It is guaranteed that there exists at least one solution. And if there are different solutions, print the lexicographic minimum one.

 

Sample Input

2
2 3
1 1 1 1
3 3
1 3 3 1

 

Sample Output

1 2
1 1 1

Hint

In the first sample, A is [1,2]. A has four subsets [],[1],[2],[1,2] and the sums of each subset are 0,1,2,3. So B=[1,1,1,1]

 

Source

2017 Multi-University Training Contest - Team 5

思路：从小到大枚举加入的i值，如果当前的数字组合得到的i的数量小于b[i]那么就要加入对应个i值，同时更新f[i]（数字和为i的集合个数）的值，直到填满n个数字。

代码：

 #include<bits/stdc++.h>
 #define db double
 #define ll long long
 #define ci(x) scanf("%d",&x)
 #define cd(x) scanf("%lf",&x)
 #define cl(x) scanf("%lld",&x)
 #define pi(x) printf("%d\n",x)
 #define pd(x) printf("%f\n",x)
 #define pl(x) printf("%lld\n",x)
 #define fr(i,a,b) for(int i=a;i<=b;i++)
 using namespace std;
 const int N=1e5+;
 const int mod=1e9+;
 const int MOD=mod-;
 const db  eps=1e-;
 const int inf = 0x3f3f3f3f;
 int b[N],f[N],a[N];
 int main()
 {
 //    ios::sync_with_stdio(false);
 //    cin.tie(0);
     int t;
     ci(t);
     for(int ii=;ii<=t;ii++)
     {
         int n,m,c=;
         ci(n),ci(m);
         for(int i=;i<=m;i++) ci(b[i]);
         memset(f,,sizeof(f));
         f[]=;
         for(int i=;i<=m;i++){//我们要加入的数字i
             int v=b[i]-f[i];//加入v个i
             for(int j=;j<v;j++){
                 a[++c]=i;
                 for(int k=m;k>=i;k--){
                     f[k]+=f[k-i];//更新当前组合的种数
                 }
             }
         }
         for(int i=;i<=n;i++){
             printf("%d%c",a[i],i==n?'\n':' ');
         }
     }
 }