# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
391922 | BartolM | Bootfall (IZhO17_bootfall) | C++17 | 1016 ms | 1092 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.
#define DEBUG 1
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
const int INF=0x3f3f3f3f;
const int N=505;
int n, uk=0;
int p[N], cnt[N*N];
vector <int> sol;
bitset <N*N> curr;
void resi(int ne) {
curr.reset();
curr.set(0);
for (int i=0; i<n; ++i) {
if (i==ne) continue;
curr=curr | (curr<<p[i]);
}
}
void solve() {
resi(n);
if (!curr[uk/2]) {
printf("0\n");
return;
}
for (int i=0; i<n; ++i) {
resi(i);
for (int j=0; j<=uk; ++j) {
int br=p[i]+2*j-uk;
if (br>=0 && br<=uk && curr[j]) cnt[br]++;
}
}
for (int i=0; i<=uk; ++i) if (cnt[i]==n) sol.pb(i);
printf("%d\n", sol.size());
for (int x:sol) printf("%d ", x);
}
void load() {
scanf("%d", &n);
for (int i=0; i<n; ++i) scanf("%d", p+i);
for (int i=0; i<n; ++i) uk+=p[i];
}
int main() {
load();
solve();
return 0;
}
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... |