# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934013 | dilanyan | Bootfall (IZhO17_bootfall) | C++17 | 196 ms | 5844 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.
//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------Kargpefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
void KarginSet(string name = "") {
ios_base::sync_with_stdio(false); cin.tie(NULL);
if (name.size()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
//-------------------KarginConstants------------------\\
const ll mod = 1000000007;
const ll inf = 1e9;
//-------------------KarginCode-----------------------\\
const int N = 300005;
int a[N], dp[N], dp1[N];
int good[N];
void KarginSolve() {
int n; cin >> n;
int sum = 0;
for (int i = 1;i <= n;i++) {
cin >> a[i];
sum += a[i];
}
dp[0] = 1;
for (int i = 1;i <= n;i++) {
for (int j = sum - a[i];j >= 0;j--) {
if (dp[j]) dp[j + a[i]] += dp[j];
}
}
if (sum % 2 || !dp[sum / 2]) {
cout << "0\n";
return;
}
for (int i = 1;i <= n;i++) {
for (int j = 0;j <= sum;j++) dp1[j] = dp[j];
sum -= a[i];
for (int j = 0;j <= sum - a[i];j++) dp1[a[i] + j] -= dp1[j];
for (int j = sum / 2;j <= sum;j++) {
if (dp1[j]) good[2 * j - sum]++;
}
sum += a[i];
}
vector<int> ans;
for (int i = 1;i <= sum;i++) {
if (good[i] == n) ans.pb(i);
}
cout << ans.size() << '\n';
for (int i : ans) cout << i << ' ';
}
int main() {
KarginSet();
int test = 1;
//cin >> test;
while (test--) {
KarginSolve();
}
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... |