# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35293 | dqhungdl | Bootfall (IZhO17_bootfall) | C++14 | 1000 ms | 5800 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>
using namespace std;
const int mod=1e9+7,mod2=1e9+7;
int n,sum,a[505],C[250005],f[250005],f2[250005];
vector<int> rs;
bool Special()
{
if(sum%2==1)
return false;
f[0]=1;
for(int i=1;i<=n;i++)
for(int j=sum;j>=a[i];j--)
f[j]=(f[j]+f[j-a[i]])%mod;
return (f[sum/2]>0);
}
void Check(int pos)
{
for(int i=a[pos];i<=sum;i++)
f[i]=(f[i]-f[i-a[pos]]+mod)%mod;
for(int i=0;i<(sum-a[pos]+1)/2;i++)
if(f[i]>0||f2[i]>0)
C[sum-a[pos]-2*i]++;
for(int i=sum;i>=a[pos];i--)
f[i]=(f[i]+f[i-a[pos]])%mod;
}
int main()
{
//freopen("TEST.INP","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
if(Special()==false)
{
printf("0");
return 0;
}
for(int i=1;i<=n;i++)
Check(i);
for(int i=1;i<=sum;i++)
if(C[i]==n)
rs.push_back(i);
printf("%d\n",int(rs.size()));
for(int i=0;i<rs.size();i++)
printf("%d ",rs[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |