| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 333684 | beksultan04 | Bootfall (IZhO17_bootfall) | C++14 | 85 ms | 492 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;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int a[N],b[N],q[N],dp[N],n,sum;
void add(int x){
int i;
for (i=5000;i>=0;--i){
dp[i+x]+=dp[i];
}
ret ;
}
void del(int x){
int i;
for (i=0;i<=5000;++i){
dp[i+x]-=dp[i];
}
ret ;
}
bool is(int x){
int i;
for (i=1;i<=n;++i){
del(q[i]);
if (dp[(sum-q[i]+x)/2-x]==0){
add(q[i]);
ret 0;
}
add(q[i]);
}
ret 1;
}
main(){
int i,j,x;
scan1(n)
for (i=1;i<=n;++i)
scan1(q[i])
dp[0]=1;
for (i=1;i<=n;++i){
if (i!= 1 && q[i] %2 != q[i-1]%2){
cout <<0;
ret 0;
}
sum+=q[i];
add(q[i]);
}
if (dp[sum/2]==0 || sum&1){
cout <<0;
ret 0;
}
vector <int> ans;
for (x=1;x<5000;++x){
if (x%2 == q[1]%2 && is(x))ans.pb(x);
}
cout <<ans.size()<<"\n";
for (i=0;i<ans.size();++i){
cout <<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... | ||||
