hdu 6092 Rikka with Subset (集合計數,01背包)
阿新 • • 發佈：2017-08-10
restore tdi [0 print set ace each rst col 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]
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
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]
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 #include <bits/stdc++.h> 2 3 using namespace std; 4 typedef long long ll; 5 const int maxn = 5e5+500; 6 int n,m; 7 ll cnt[maxn]; 8 ll sum[maxn]; 9 int num[maxn]; 10 int main() 11 { 12 //freopen("de.txt","r",stdin); 13 int T; 14 scanf("%d",&T); 15 while (T--){ 16 memset(sum,0,sizeof sum); 17 memset(num,0,sizeof num); 18 scanf("%d%d",&n,&m); 19 for (int i=0;i<=m;++i) 20 scanf("%lld",&cnt[i]); 21 num[0]=0; 22 sum[0]=cnt[0]; 23 while((1<<num[0])<cnt[0]) num[0]++; 24 for (int i=1;i<=m;++i){ 25 num[i]=(cnt[i]-sum[i])/sum[0];//num[i]*sum[0]+sum[i]=cnt[i] 26 for (int j=1;j<=num[i];++j){//一個一個的加入幾個 27 for (int k=m;k>=i;--k){//完全背包思想更新sum 28 sum[k]+=sum[k-i]; 29 } 30 } 31 } 32 vector<int> vec; 33 for (int i=0;i<=m;++i){ 34 for (int j=0;j<num[i];++j) 35 vec.push_back(i); 36 } 37 for (int i=0;i<vec.size();++i) 38 printf("%d%c",vec[i],i==(vec.size()-1)?‘\n‘:‘ ‘); 39 } 40 return 0; 41 }
hdu 6092 Rikka with Subset (集合計數,01背包)