HDU6092 Rikka with Subset-01背包dp-2017多校联盟5 第8题
来源:互联网 发布:仓库数据表格 编辑:程序博客网 时间:2024/05/21 19:42
Rikka with Subset
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)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 hasn positive A1−An and their sum is m . Then for each subset S of A , Yuta calculates the sum of S .
Now, Yuta has got2n numbers between [0,m] . For each i∈[0,m] , he counts the number of i s he got as Bi .
Yuta shows Rikka the arrayBi and he wants Rikka to restore A1−An .
It is too difficult for Rikka. Can you help her?
Yuta has
Now, Yuta has got
Yuta shows Rikka the array
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 numbersn,m(1≤n≤50,1≤m≤104) .
The second line containsm+1 numbers B0−Bm(0≤Bi≤2n) .
For each testcase, the first line contains two numbers
The second line contains
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.
It is guaranteed that there exists at least one solution. And if there are different solutions, print the lexicographic minimum one.
Sample Input
22 31 1 1 13 31 3 3 1
Sample Output
1 21 1 1HintIn 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个数,和为m,这个序列能组成2^n个子序列,bi表示这些子序列中和为i的个数现在给你bi,i∈[0,m]求出序列a,a按字典序输出解题思路首先能明确的是b[0]一定等于1,并且b中第一个不为0的i一定有b[i]个。b[i]=i的个数+组合成i的方案数.当确定a中存在i,并且能组合出j-i,那么一定能组合出j,这种途径得到j的方案数就是j-i的方案数*/#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int maxn = 1e4 + 10;int dp[maxn];///组合成i的方案数,不包括i本身,(准确的说是在完成第46行循环之前不包括本身。)int b[maxn];int n,m;int main(){ int t; scanf("%d", &t); while (t > 0) { t--; memset(dp,0,sizeof(dp)); dp[0] = 1; scanf("%d%d",&n,&m); for(int i = 0;i<=m;++i){ scanf("%d",&b[i]); } bool f = 0; for(int i = 1;i<=m;++i){ int cnt = b[i]-dp[i];///b[i]=i的个数+组成i的方案数dp[i] if(cnt<=0) continue;///不存在i for(int k = 0;k<cnt;++k){///a里面肯定有cnt个i if(f) printf(" "); f=1; printf("%d",i); for(int j = m;j>=i;--j){ dp[j] += dp[j-i];///组成j-i的方案分别加上i就能组成j,加上这种途径获得的方案数 //dp[j+i] += dp[j];一样的也能过,注意j的范围 } } } puts(""); } return 0;}
阅读全文
1 0
- HDU6092 Rikka with Subset-01背包dp-2017多校联盟5 第8题
- HDU6092 Rikka with Subset(01背包,2017 HDU多校联赛 第5场)
- HDU6092 Rikka with Subset(01背包+思路)
- HDU6092-2017多校5&&背包&贪心-Rikka with Subset
- 【2017多校】HDU6092 Rikka with Subset 【DP】
- HDU6092-Rikka with Subset(背包)
- HDU6092 Rikka with Subset【DP】
- HDU6092---Rikka with Subset(2017多校联赛:逆向dp)
- hdu6092 Rikka with Subset (反向背包)
- HDU6092 Rikka with Subset
- HDU6092-Rikka with Subset
- hdu6092 Rikka with Subset
- HDU6092(Rikka with Subset)
- HDU6092-Rikka with Subset
- Hdu6092 Rikka with Subset(2017多校第5场) 逆推背包
- (hdu6092) 2017杭电多校联赛第5场-Rikka with Subset 动态规划
- Hdu6092 Rikka with Subset(2017多校第5场)
- 2017多校训练Contest5: 1008 Rikka with Subset hdu6092
- MongoDB文档存储
- js系列教程9-表单元素全解
- 爬虫实战4—多线程与多进程爬虫
- Android ButterKnife Zelezny 插件
- 2017年8月9日提高组T2 覆盖
- HDU6092 Rikka with Subset-01背包dp-2017多校联盟5 第8题
- Java字符串常用方法
- SSL2673 2017年8月9日提高组T1 水题
- 关于byte的溢出问题
- 二叉树的先中后序遍历,递归遍历,非递归遍历
- matlab多维数组操作
- Mac安装Tensorflow,运行项目报错: module compiled against API version 0xa but this version of numpy is 0x9
- Android Code Generator
- Java 里面split用法小结