Barbells Gym - 101291B

https://cn.vjudge.net/problem/Gym-101291B

三进制枚举~ or二进制枚举

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;

int a[22],b[22];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,m;
    scanf("%d%d",&n,&m);

    for(int i=0;i<n;i++) sfi(a[i]);
    for(int i=0;i<m;i++) sfi(b[i]);

    int s=1;
    for(int i=0;i<m;i++) s*=3;

    set<ll>st;
    for(int i=0;i<s;i++)
    {
        int tmp=i;
        int cnt=0;
        ll sum1=0;
        ll sum2=0;

        while(tmp)
        {
            if(tmp%3==1) sum1+=b[cnt];
            else if(tmp%3==2) sum2+=b[cnt];
            cnt++;
            tmp/=3;
        }
        if(sum1==sum2)
        {
            for(int j=0;j<n;j++)
                st.insert(sum1+sum2+a[j]);
        }
    }

    for(auto &x:st)
    {
        printf("%I64d\n",x);
    }


    return 0;
}

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;

int a[22],b[22];

struct node
{
    int bit;
    ll val;
}p[maxn];
bool cmp(node x,node y)
{
    return x.val<y.val;
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,m;
    scanf("%d%d",&n,&m);

    for(int i=0;i<n;i++) sfi(a[i]);
    for(int i=0;i<m;i++) sfi(b[i]);

    int s=(1<<m);
    for(int i=0;i<s;i++)
    {
        int tmp=i;
        int cnt=0;
        while(tmp)
        {
            if(tmp&1) p[i].val+=b[cnt];
            cnt++;
            tmp>>=1;
        }
        p[i].bit=i;
    }

    sort(p,p+s,cmp);

    set<ll>st;

    for(int i=0;i<s;i++)
    {
        for(int j=i+1;j<s;j++)
        {
            if(p[i].val!=p[j].val)
            {
                break;
            }
            else
            {
                //cout<<p[i].bit<<" "<<p[j].bit<<" "<<(p[i].bit&p[j].bit)<<endl;

                if((p[i].bit&p[j].bit)==0)
                {
                    st.insert(p[i].val);
                }
            }
        }
    }

    set<ll> ans;
    for(int i=0;i<n;i++)
    {
        ans.insert(a[i]);
        for(auto &x:st)
        {
            ans.insert(a[i]+x*2);
        }
    }


    for(auto &x:ans)
    {
        printf("%I64d\n",x);
    }


    return 0;
}