传送门
文章目录
- 题意：
- 思路：
题意：
思路：
疯狂水文章。
这个很明显是个背包，我们开一个布尔数组，之后枚举每组的个数，让后枚举1−61-61−6，再枚举容量kkk，注意顺序不能错了，让后或一下就好啦。
还可以用bitsetbitsetbitset做，可能是因为bitsetbitsetbitset每次移动的NNN是固定的，而枚举的sumsumsum是根据每次都不一样的，所以bitsetbitsetbitset慢很多。。
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<bitset>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid (tr[u].l+tr[u].r>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;const int N=200010,mod=1e9+7,INF=0x3f3f3f3f;
const double eps=1e-6;int a[10];
bool f[N];int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);int id=0;while(cin>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]&&(a[1]+a[2]+a[3]+a[4]+a[5]+a[6])) {printf("Collection #%d:\n",++id);int sum=0; memset(f,false,sizeof(f));for(int i=1;i<=6;i++) sum+=a[i]*i;if(sum%2==1) {puts("Can't be divided.");puts("");continue;}f[0]=1;for(int i=1;i<=6;i++) {for(int j=1;j<=a[i];j++)for(int k=sum;k>=0;k--)f[k+i]|=f[k];}if(f[sum/2]) puts("Can be divided.");else puts("Can't be divided.");puts("");}return 0;
}
/**///#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<bitset>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid (tr[u].l+tr[u].r>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;const int N=200010,mod=1e9+7,INF=0x3f3f3f3f;
const double eps=1e-6;int a[N];
bitset<N>f;int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);int id=0;while(cin>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]&&(a[1]+a[2]+a[3]+a[4]+a[5]+a[6])) {printf("Collection #%d:\n",++id);int sum=0; f.reset();for(int i=1;i<=6;i++) sum+=a[i]*i;if(sum%2==1) {puts("Can't be divided.");puts("");continue;}f[0]=1;for(int i=1;i<=6;i++) {for(int j=1;j<=a[i];j++)f|=f<<i;}if(f[sum/2]) puts("Can be divided.");else puts("Can't be divided.");puts("");}return 0;
}
/**/
