Submission #933988

#	Time	Username	Problem	Language	Result	Execution time	Memory
933988		dilanyan	Bootfall (IZhO17_bootfall)	C++17	13 / 100	1008 ms	592 KiB

bootfall

//-------------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 = 200005;
int a[N], dp[N];

void KarginSolve() {
    int n; cin >> n;
    int sum = 0;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        sum += a[i];
    }
    vector<int> ans;
    dp[0] = 1;
    for (int i = 1;i <= n;i++) {
        for (int j = sum - a[i];j >= 0;j--) {
            if (dp[j]) dp[a[i] + j] += dp[j];
        }
    }
    if (!((sum % 2 == 0) && dp[sum / 2])) {
        cout << "0\n";
        return;
    }
    for (int x = 1;x <= sum;x++) {
        int s = x;
        sum += s;
        for (int j = sum - s;j >= 0;j--) {
            if (dp[j]) dp[s + j] += dp[j];
        }
        bool flag = true;
        for (int i = 1;i <= n;i++) {
            for (int j = 0;j <= sum - a[i];j++) {
                dp[j + a[i]] -= dp[j];
            }
            if (!(((sum - a[i]) % 2 == 0) && dp[(sum - a[i]) / 2])) {
                flag = false;
            }
            for (int j = sum - a[i]; j >= 0;j--) {
                if (dp[j]) dp[j + a[i]] += dp[j];
            }
            if (!flag) break;
        }
        if (flag) ans.pb(s);
        for (int j = 0;j <= sum;j++) {
            dp[s + j] -= dp[j];
        }
        sum -= s;
    }
    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)

bootfall.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
bootfall.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
bootfall.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
bootfall.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
bootfall.cpp: In function 'void KarginSet(std::string)':
bootfall.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 21
• Subtask 6: 0 / 35