HDU 6092 Rikka with Subset

Rikka with Subset

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

 

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

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cctype> 
#include<cmath>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<algorithm>
#include<string> 
#define ll long long
#define eps 1e-10
#define LL unsigned long long
using namespace std; 
const int inf=0x3f3f3f3f;
const int maxn=10000+10;
const int mod=1e9+7;
int a[maxn],b[maxn];
int main()
{
    int t,n,m;
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof(a));
        scanf("%d%d",&n,&m);
        for(int i=0;i<=m;i++)scanf("%d",&b[i]);
        for(int i=1;i<=n;i++){
            int flag=0;
            for(int j=1;j<=m;j++){
                if(b[j]==0)continue;
                if(b[j]&&flag==0){
                    flag=1;
                    a[i]=j;
                }
                b[j]=b[j]-b[j-a[i]];
            }
        }
        for(int i=1;i<=n;i++)
        printf("%s%d",i==1?"":" ",a[i]);
        printf("\n");
    }
    return 0;
}