bzoj2679: [Usaco2012 Open]Balanced Cow Subsets(折半搜索)

2679: [Usaco2012 Open]Balanced Cow Subsets

Time Limit: 10 Sec  Memory Limit: 128 MB
Submit: 462  Solved: 197
[Submit][Status][Discuss]

Description

Farmer John's owns N cows (2 <= N <= 20), where cow i produces M(i) units of milk each day (1 <= M(i) <= 100,000,000). FJ wants to streamline the process of milking his cows every day, so he installs a brand new milking machine in his barn. Unfortunately, the machine turns out to be far too sensitive: it only works properly if the cows on the left side of the barn have the exact same total milk output as the cows on the right side of the barn! Let us call a subset of cows "balanced" if it can be partitioned into two groups having equal milk output. Since only a balanced subset of cows can make the milking machine work, FJ wonders how many subsets of his N cows are balanced. Please help him compute this quantity.

给出N（1≤N≤20）个数M(i) (1 <= M(i) <= 100,000,000)，在其中选若干个数，如果这几个数可以分成两个和相等的集合，那么方案数加1。问总方案数。

Input

 Line 1: The integer N. 

 Lines 2..1+N: Line i+1 contains M(i).

Output

* Line 1: The number of balanced subsets of cows.

Sample Input

4 1 2 3 4
INPUT DETAILS: There are 4 cows, with milk outputs 1, 2, 3, and 4.

Sample Output

3
OUTPUT DETAILS: There are three balanced subsets: the subset {1,2,3}, which can be partitioned into {1,2} and {3}, the subset {1,3,4}, which can be partitioned into {1,3} and {4}, and the subset {1,2,3,4} which can be partitioned into {1,4} and {2,3}.

HINT

 

Source

/*
判断能否划分为两个相等集合时用dp RE了
*/
#include<bits/stdc++.h>

 #define N 30
 #define M 3111111
 #define mod 2333333

 using namespace std;
 int n,m,ans,cnt,flag;
 int a[N],vis[N],V[M];
 int cur[N],sum[N];

 inline int read()
 {
     int x=,f=;char c=getchar();
     while(c>''||c<''){if(x=='-')f=-;c=getchar();}
     while(c>=''&&c<=''){x=x*+c-'';c=getchar();}
     return x*f;
 }

 bool dfs2(int cur[],int k,int val,int n)
 {
     if(n== && cur[]!=cur[]) return false;
     if(flag) return true;
     if(val==sum[n]-val) {flag=;return true;}
     if(k==n && !flag) return false;
     for(int i=k+;i<=n;i++)
     dfs2(cur,i,val+cur[i],n),dfs2(cur,i,val,n);
     if(!flag)return false;
 }

 bool judge()
 {
     int cnt_=,S=;
     memset(cur,,sizeof cur);
    memset(sum,,sizeof sum);
     for(int i=;i<=n;i++) if(vis[i]) cur[++cnt_]=a[i],sum[cnt_]=sum[cnt_-]+cur[cnt_];
     sort(cur+,cur+cnt_+);
     for(int i=;i<=cnt_;i++) S+=S*+cur[i],S%=mod;
     if(V[S]) return false;V[S]=;flag=;
     if(sum[cnt_]%) return false;
     if(dfs2(cur,,,cnt_)) return true;
     return false;

 }

 void dfs(int lim,int k,int tot)
 {
     if(tot==lim)
     {
         if(judge()) ans++;
         return;
    }
     if(k>n) return;
     for(int i=k+;i<=n;i++)
     {
         if(vis[i]) continue;
         vis[i]=;dfs(lim,k+,tot+);
         vis[i]=;
    }
 }

 int main()
 {
    //freopen("ly.in","r",stdin);
     n=read();
     for(int i=;i<=n;i++) a[i]=read();
     cnt=;
    while(cnt<=n)
    {
        memset(vis,,sizeof vis);
        dfs(cnt,,);
        cnt++;
    }
    printf("%d\n",ans);
    return ;
 }

24暴搜

/*
折半搜索
枚举每个数如何选择，放入A就加，放入B就减
状压判断每个数的具体选择状态
最后双指针扫统计答案  若集合A的和 + 集合B的和为0那么就说明这两个集合构成的答案合法
*/
#include<bits/stdc++.h>

#define N 22
#define ll long long

using namespace std;
int n,v[N<<],maxdep,cnta,cntb;
bool vis[<<N];
ll ans;
struct node{
    int state,x;
}a[<<N],b[<<N];
inline bool cmp1(node a,node b){return a.x<b.x;}
inline bool cmp2(node a,node b){return a.x>b.x;}

inline int read()
 {
     int x=,f=;char c=getchar();
     while(c>''||c<''){if(x=='-')f=-;c=getchar();}
     while(c>=''&&c<=''){x=x*+c-'';c=getchar();}
     return x*f;
 }

void dfs(int dep,int sum,int now,int flag)
{
    if(dep==maxdep+)
    {
        if(!flag)
            a[++cnta].x=sum,a[cnta].state=now;
        else
            b[++cntb].x=sum,b[cntb].state=now;
        return;
    }
    dfs(dep+,sum,now,flag);
    dfs(dep+,sum+v[dep],now | (<<(dep-)),flag);
    dfs(dep+,sum-v[dep],now | (<<(dep-)),flag);
}
int main()
{
    n=read();
    for(int i=; i<=n; i++)v[i]=read();
    maxdep=n/;dfs(,,,);
    maxdep=n;  dfs(n/+,,,);
    sort(a+,a++cnta,cmp1);
    sort(b+,b++cntb,cmp2);

    int l=,r=;
    while(l<=cnta&&r<=cntb)
    {
        while(-a[l].x<b[r].x&&r<=cntb)r++;
        int pos=r;
        while(r<=cntb&&-a[l].x==b[r].x)
        {
            if(!vis[a[l].state | b[r].state])
            {
                vis[a[l].state | b[r].state]=;
                ans++;
            }r++;
        }
        if(l<cnta&&a[l].x==a[l+].x)r=pos;
        l++;
    }
    printf("%lld\n",ans-);//减去空集
    return ;
}