# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39857 | igzi | Bootfall (IZhO17_bootfall) | C++14 | 526 ms | 5808 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 maxn = 505;
const int mx = 250000;
int n;
int a[maxn], cnt[mx+505];
int dp[mx+505], temp[mx+505];
vector<int> ans;
int main() {
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int sum = 0;
for(int i=1;i<=n;i++) sum += a[i];
dp[0] = 1;
for(int i=1;i<=n;i++) {
for(int x=mx;x>=0;x--) dp[x+a[i]] += dp[x];
}
if(sum%2!=0 || dp[sum/2]==0) return !printf("0");
for(int i=1;i<=n;i++) {
memset(temp,0,sizeof(temp));
for(int x=0;x<=mx;x++) {
temp[x] += dp[x];
temp[x+a[i]] -= temp[x];
}
for(int x=0;x<=mx;x++) {
if((sum-a[i]+x)%2==0 && sum-a[i]-x>=0 && temp[(sum-a[i]-x)/2]!=0) cnt[x]++;
}
}
for(int i=1;i<=mx;i++) if(cnt[i]==n) ans.push_back(i);
printf("%d\n",ans.size());
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... |