제출 #1112892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1112892		adiyer	Bootfall (IZhO17_bootfall)	C++17	44 / 100	1056 ms	1416 KiB

bootfall

#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;
 
ll n, s;
ll a[N];

bool ok[500 * 500 + 3];

bitset < 500 * 500 > dp;
 
void sol(){
	cin >> n, dp[0] = 1;
	for(ll i = 1; i <= n; i++) cin >> a[i], dp |= (dp << a[i]), s += a[i];
	for(ll i = 1; i <= s; i++) ok[i] = 1;
	if(s % 2 || dp[s / 2] == 0){
		cout << "0\n";
		return;
	}
	for(ll i = 1; i <= n; i++){
		dp &= 0, dp[0] = 1; 
		s -= a[i];
		for(ll j = 1; j <= n; j++)
			if(i != j)
				dp |= (dp << a[j]);
		for(ll j = 1; j <= 500 * 500; j++){
			if(s < j || (s - j) % 2) ok[j] = 0;
			else ok[j] &= dp[(s - j) / 2];	
		}
		s += a[i];
	}
	vector < ll > ans;
	for(ll i = 1; i <= 500 * 500; i++)
		if(ok[i])
			ans.pb(i);
	cout << ans.size() << '\n';
	for(ll x : ans) cout << x << ' ';
}
 
signed main(){
	ios                     
	sol();
// 	slow();
//  stress();
}

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