Submission #1112913

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112913		adiyer	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1044 ms	1964 KiB

bootfall

#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")

#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
 
using namespace std;
 
typedef int ll;
 
const int N = 5e2 + 11;
const int MAX = 1e6;
 
short int n;
 
int s;
 
short int a[N];
 
bool ok[500 * 500 + 3];
 
bitset < 500 * 500 + 3 > d, dp;
 
void sol(){
	cin >> n, d[0] = 1;
	for(ll i = 1; i <= 500 * 500; i++) ok[i] = 1;
	for(ll i = 1; i <= n; i++) cin >> a[i], d |= (d << a[i]), s += a[i];
	if(s % 2 || d[s / 2] == 0){
		cout << "0\n";
		return;
	}
	for(short int i = 1; i <= n; i++){
		dp &= 0;
		dp[0] = 1, s = 0;
		for(short int j = 1; j <= n; j++)
			if(i != j)
				dp |= (dp << a[j]), s += a[j];
		for(int j = 1; j <= 500 * 500; j++){
			if(s < j || (s - j) % 2) ok[j] = 0;
			else ok[j] &= dp[(s - j) / 2];	
		}
	}
	vector < int > ans;
	for(int i = 1; i <= 500 * 500; i++){
		if(ok[i]){
			ans.pb(i);
		}
	}
	cout << ans.size() << '\n';
	for(int x : ans) cout << x << ' ';
}
 
signed main(){
	ios                     
	sol();
// 	slow();
//  stress();
}

Compilation message (stderr)

bootfall.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize ("g",on)
      |

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