HDU 6092 Rikka with Subset （2017多校5-背包）

题意：

告诉你n 和m

告诉你b0,b1,,,bm

bi表示数组a 中所有子集的和为i 的方案数。

让你还原一个最小字典序的数组a。

思路：

令dp[i]表示 和为i 的方案数。

我们从小到达枚举， 当dp 还不到要求的方案数是 我们就 就一个i， 然后更新其他位置（背包）

到达要求就枚举下一个i。

这样从小到大枚举即为字典序最小的方案。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;


const int maxn = 10000 + 10;


int dp[maxn];

int a[maxn];

vector<int>ans;
int main(){

    int T;
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d%d",&n,&m);
        memset(dp,0,sizeof dp);
        dp[0] = 1;
        ans.clear();

        for (int i = 0; i <= m; ++i){
            scanf("%d",&a[i]);
        }

        for (int i = 1; i <= m; ++i){
            while(dp[i] < a[i]){
                ans.push_back(i);
                for (int j = m-i; j >= 0; --j){
                    dp[j + i] += dp[j];
                }
            }
        }
        for (int i = 0; i < ans.size(); ++i){
            if (i)putchar(' ');
            printf("%d", ans[i]);
        }
        putchar('\n');

    }


    dp[0] = 1;



    return 0;
}

Rikka with Subset

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

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  i s 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

 

Recommend

liuyiding   |   We have carefully selected several similar problems for you:   6095  6094  6093  6092  6091