# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37427 | HardNut | Bootfall (IZhO17_bootfall) | C++14 | 1000 ms | 3024 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 <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
const int MX = 250100;
int n;
int a[600];
int fl[MX];
bitset<MX> bb;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
for (int i = 1; i < MX; ++i)
fl[i] = 1;
for (int i = -1; i < n; ++i) {
int sum = 0;
bb.reset();
bb[0] = 1;
for (int j = 0; j < n; ++j)
if (i != j) {
sum += a[j];
bb |= (bb << a[j]);
}
if (i != -1) {
for (int j = 1; j < MX; ++j) {
if ((sum + j) % 2 == 1 || !bb[(sum + j) / 2])
fl[j] = 0;
}
}
else {
if (sum % 2 == 1 || !bb[sum / 2]) {
cout << 0 << "\n";
return 0;
}
}
}
int cnt = 0;
for (int i = 0; i < MX; ++i)
cnt += fl[i];
printf("%d\n", cnt);
for (int i = 1; i < MX; ++i) {
if (fl[i])
cout << i << " ";
}
cout << "\n";
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... |