# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112921 | adiyer | Bootfall (IZhO17_bootfall) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
const int MAX = 1e6;
short int n;
short int a[N];
int s;
vector < int > ans;
bitset < 500 * 500 + 3 > dp;
void sol(){
cin >> n, dp[0] = 1;
for(ll i = 1; i <= 500 * 500; i++) ans.pb(i);
for(ll i = 0; i < n; i++) cin >> a[i], dp |= (dp << a[i]), s += a[i];
random_shuffle(a.begin(). a.end());
if(s % 2 || dp[s / 2] == 0){
cout << "0\n";
return;
}
for(short int i = 0; i < n; i++){
dp &= 0, dp[0] = 1, s = 0;
for(short int j = 0; j < n; j++)
if(i != j)
dp |= (dp << a[j]), s += a[j];
int j = 0;
while(j < ans.size()){
if(s < ans[j] || (s - ans[j]) % 2 || !dp[(s - ans[j]) / 2]){
if(j < ans.size()) swap(ans[j], ans[ans.size() - 1]);
ans.pop_back();
}
else{
j++;
}
}
}
sort(ans.begin(), ans.end());
cout << ans.size() << '\n';
for(int x : ans) cout << x << ' ';
}
signed main(){
ios
sol();
// slow();
// stress();
}