Submission #872413

#	Time	Username	Problem	Language	Result	Execution time	Memory
872413		KiaRez	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1044 ms	3288 KiB

bootfall

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {while(a>=mod) {a-=mod;} (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, sum, a[505], res[505*505], dp[505*505];

void add(int i) {
	for(int x=500*500; x>=a[i]; x--) {
		dp[x] = MOD(dp[x] + dp[x-a[i]]);
	}
}

void del(int i) {
	for(int x=a[i]; x<=500*500; x++) {
		dp[x] = MOD(dp[x] - dp[x-a[i]]);
	}
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n;
	for(int i=1; i<=n; i++) {
		cin>>a[i]; sum+=a[i];
	}

	dp[0] = 1;
	for(int i=1; i<=n; i++) {
		add(i);
	}
	if(dp[sum/2] == 0 || sum%2==1) kill(0); 

	for(int i=1; i<=n; i++) {
		del(i);
		for(int j=1; j<=500*500; j++) {
			if(dp[(sum-a[i]+j)/2] == 0 || (sum-a[i]+j)%2==1) res[j] = 1;
		}
		add(i);
	}
	vector<int> ans;
	for(int i=1; i<=500*500; i++) {
		if(res[i] == 0) ans.pb(i);
	}

	cout<<size(ans)<<endl;
	for(auto it : ans) {
		cout<<it<<' ';
	}

	return 0;
}

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