# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167370 | GioChkhaidze | Bootfall (IZhO17_bootfall) | C++14 | 705 ms | 2772 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
using namespace std;
const int N=505;
int n,S,a[N],dp[N*N],mod=1e9+7;
vector < int > ans;
bitset < N*N > A,C;
main () {
cin>>n;
for (int i=1; i<=n; i++) {
cin>>a[i];
S+=a[i];
}
sort(a+1,a+n+1);
dp[0]=1;
for (int i=1; i<=n; i++)
for (int j=S; j>=a[i]; j--) {
dp[j]+=dp[j-a[i]];
if (dp[j]>mod) dp[j]-=mod;
}
if (S%2 || !dp[S/2]) {
cout<<0<<endl;
return 0;
}
for (int i=1; i<=S; i++)
C[i]=1;
for (int i=1; i<=n; i++) {
for (int j=a[i]; j<=S; j++) {
dp[j]-=dp[j-a[i]];
if (dp[j]<0) dp[j]+=mod;
}
S-=a[i];
for (int j=1; j<=S; j++) {
if (S<j) continue;
if (!dp[j] && !dp[S-j]) continue;
A[abs(S-j-j)]=1;
}
S+=a[i];
C=A&C,A=0;
for (int j=S; j>=a[i]; j--) {
dp[j]+=dp[j-a[i]];
if (dp[j]>mod) dp[j]-=mod;
}
}
for (int i=1; i<=S; i++)
if (C[i]) ans.push_back(i);
printf("%d\n",ans.size());
for (int i=0; i<ans.size(); i++)
printf("%d ",ans[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... |