Submission #166766

#	Time	Username	Problem	Language	Result	Execution time	Memory
166766		abil	Bootfall (IZhO17_bootfall)	C++14	100 / 100	490 ms	2936 KiB

bootfall

#include <bits/stdc++.h>

#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
#define int long long

using namespace std;

const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);

int a[N], f[N];
set<int > s;
bitset< N > b;
main()
{
	int n, sum = 0;
	scanf("%lld", &n);
	for(int i = 1;i <= n; i++){
		scanf("%lld", &a[i]);
	}
	f[0] = 1;
	for(int i = 1;i <= n; i++){
		for(int j = sum + a[i];j >= a[i]; j--){
			f[j] += f[j - a[i]];
			//if(f[j] >= mod){
				//f[j] -= mod;
			//}
		}
		sum += a[i];
	}
	if(!f[sum / 2] || sum & 1){
		cout << 0;
		return 0;
	}
	for(int i = 1;i <= sum; i++){
		b[i] = 1;
	}
	//for(int i = 1;i <= sum; i++){
		//cout << f[i] << " ";
	//}
	//cout << endl;
	for(int i = 1;i <= n; i++){
		for(int j = a[i];j <= sum; j++){
			f[j] -= f[j - a[i]];
			//if(f[j] < 0){
				//f[j] += mod;
			//}
		}
		//for(int j = 1;j <= sum; j++){
			//cout << f[j] << " ";
		//}
		//cout << endl;
		for(int j = 1;j <= sum; j++){
			if((sum - a[i] + j) & 1 || !f[(sum - a[i] + j) / 2]){
				b[j] = 0;
			}
		}
		for(int j = sum;j >= a[i]; j--){
			f[j] += f[j - a[i]];
			//if(f[j] >= mod){
				//f[j] -= mod;
			//}
		}
	}
	cout << b.count() << endl;
	for(int i = 1;i <= sum; i++){
		if(b[i]){
			cout << i << " ";
		}
	}
}

Compilation message (stderr)

bootfall.cpp:19:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
bootfall.cpp: In function 'int main()':
bootfall.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
bootfall.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a[i]);
   ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 15 / 15
• Subtask 4: 16 / 16
• Subtask 5: 21 / 21
• Subtask 6: 35 / 35