acwing 318. 划分大理石

 

 

多重背包及优化

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

#include <bits/stdc++.h> using namespace std ;  const int N=5e5+10;  int c[N],S,n,f[N];     int solve(){     int i,j;     S=0;     memset(f,0,sizeof f);     int flag=0;     for(i=1;i<=6;i++){         cin>>c[i]; S+=i*c[i]; if(c[i]) flag=1;     }     if(flag==0) return 0;           if(S%2){         cout<<"Can't\n";return 1;     }     f[0]=1;           for(i=1;i<=6;i++){         int t=c[i];         for(int k=1;k<=t;k<<=1){             for(j=S;j>=k*i;j--){                 f[j]|=f[j-k*i];             }             t-=k;         }         if(t)          for(j=S;j>=t*i;j--)           f[j]|=f[j-t*i];     }            if(f[S/2]) cout<<"Can"; else cout<<"Can't";cout<<endl;             return 1;  }    signed main(){     while(solve());  }