【HDU 5616 Jam's balance】 折半枚举

hdoj5616
• n个砝码，可以放在天平左右两侧或不放
• m次询问，每次询问是否可以测出给定重量
• 1 ≤ n ≤ 20
• 1 ≤ m ≤ 100

容易想到3^20的做法
但是这样显然会超时 那么我们把他拆成两个也就是一半
注意砝码要嘛相加 要嘛大减小
用set存两种枚举会出现的大小

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
bool a[20005];
int v[255];
set<int> st,st_;
bool cmp(int a,int b)
{
    return a >b;
}

void dfs(int x,int ed,int l,int r)
{
    st.insert(max(l,r)-min(l,r));
    st.insert(l+r);
    if(x==ed+1) return ;
    dfs(x+1,ed,l,r);
    dfs(x+1,ed,l+v[x],r);
    dfs(x+1,ed,l,r+v[x]);
}
void dfs_(int x,int ed,int l,int r)
{
    st_.insert(max(l,r)-min(l,r));
    st_.insert(l+r);
    if(x==ed+1) return ;
    dfs_(x+1,ed,l,r);
    dfs_(x+1,ed,l+v[x],r);
    dfs_(x+1,ed,l,r+v[x]);
}

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int t,n,m;
    scanf("%d",&t);
    while(t--)
    {
        memset(a,false,sizeof(a));
        scanf("%d",&n);
        for(int i = 1;i<=n;++i)
            scanf("%d",&v[i]);
        int tmp = n/2,tmp_ = n - tmp;
        st.clear();
        st_.clear();
        dfs(1,tmp,0,0);
        dfs_(tmp+1,n,0,0);
        scanf("%d",&m);
        for(set<int>::iterator it = st.begin();it!=st.end();++it)
            for(set<int>::iterator it_ = st_.begin();it_!=st_.end();++it_)
            {
                a[max(*it,*it_)-min(*it,*it_)] = true;
                a[*it+*it_] = true;
            }
        for(int i = 1;i<=m;++i)
        {
            int ck;
            scanf("%d",&ck);
            if(a[ck]) puts("YES");
            else puts("NO");
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}