Hdu6092 Rikka with Subset（2017多校第5场）

Jelly_acm

于 2017-08-09 21:48:56 发布

阅读量390

点赞数

分类专栏： HDU ----组合数学

本文链接：https://blog.csdn.net/Jelly_acm/article/details/77017458

版权

HDU 同时被 2 个专栏收录

181 篇文章 0 订阅

订阅专栏

----组合数学

4 篇文章 0 订阅

订阅专栏

Rikka with Subset

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

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

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

————————————————————————————————————

题目的意思是有一个数列 a[] ,长度（n<=50）。b[i] 表示元素和为 i 的集合个数。给你一个数列 b[] ，长度（m<=10000），让你求 a[]，并按照其字典序最小输出。

思路：从小到大枚举处理a，每次枚举一个数，算出它的个数，并且将它可以自由组合出来的数把后面的个数修正掉。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <unordered_map>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int T;
int n,m;

LL c[55][55];

LL a[100], b[10011];

void csh()
{
    int i, j;
    c[0][0] = 1;
    for(i = 1; i < 55; i++)
    {
        c[i][0] = c[i][i] = 1;
        for(j = 1; j < i; j++)
        {
            c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
        }
    }
}

int main()
{
    int i, j, k;
    csh();
    for(scanf("%d",&T); T--;)
    {
        scanf("%d%d",&n,&m);
        for(i = 0; i <= m; i++)
            scanf("%lld", b + i);
        for(i = 1; i <= m; i++)
        {
            if(b[i] == 0) continue;
            for(j = i + 1; j <= m; j++)
            {
                for(k = 1; k <= b[i]; k++)
                {
                    if(j - i * k < i) break;
                    if(j - i * k != i)
                    {
                        b[j] -= c[b[i]][k] * b[j - i * k];
                    }
                    else
                        b[j] -= c[b[i]][k + 1];
                }
            }
        }
        int flag=1;
        for(i = 1; i <= m; i++)
        {
            while(b[i]--)
            {
                if(flag) flag=0;
                else printf(" ");
                printf("%d", i);
            }
        }
        printf("\n");
    }
    return 0;
}