# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93353 | toloraia | Bootfall (IZhO17_bootfall) | C++14 | 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.
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int N = 505, M = 260010;
const int B = 1e9 + 7;
int n;
int a[N];
int S;
int DP[M];
int dp[M];
int ans[M], ANS[M];
int V[M], np;
int i, j, i1;
int main()
{
cin>>n;
for (i = 1; i <= n; i++){
cin>>a[i];
S += a[i];
}
sort (a + 1, a + n + 1);
bool ok = 0;
for (i = 2; i <= n; i++)
if ((a[i] - a[i - 1]) % 2 == 1)
ok = 1;
if (S % 2 == 1)
ok = 1;
if (ok){
cout<<0<<endl;
return 0;
}
F[0] = 1;
DP[0] = 1;
for (i = 1; i <= n; i++){
for (j = S; j >= a[i]; j--){
DP[j] += DP[j - a[i]];
if (DP[j] >= B)
DP[j] -= B;
}
}
if (DP[S / 2] == 0){
cout<<0<<endl;
return 0;
}
for (int I = 1; I <= n; ++I){
for (int i = 0; i <= S; ++i1){
dp[i] = DP[i];
ans[abs (S - 2 * i - a[I])] = 0;
}
for (int i = 0; i <= S; ++i){
f = 1;
if (i >= a[I]){
f = 0;
dp[i] -= dp[i - a[I]];
if (dp[i] < 0)
dp[i] += B;
if (dp[i])
f = 1;
}
if (f && ans[abs (S - a[I] - 2 * i)] == 0){
ans[abs (S - a[I] - 2 * i)] = 1;
ANS[abs (S - a[I] - 2 * i)]++;
}
}
}
np = 0;
for (i = 1; i <= S; i++)
if (ANS[i] == n)
V[np++] = i;
cout<<np<<endl;
for (i = 0; i < np; i++)
cout<<V[i]<<" ";
cout<<endl;
return 0;
}