oj.uz

Submission #677766

# Submission time Handle Problem Language Result Execution time Memory
677766 2023-01-04T10:32:57 Z Mher Bootfall (IZhO17_bootfall) C++14
0 / 100
 1 ms 468 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <queue>

using namespace std;

const int N = 503, mod = 1e9 + 7;

int n, sum = 0;
int a[N];
set<int> dp[N];

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        sum += a[i];
    }
    if (sum % 2 == 1)
    {
        cout << 0 << endl;
        return;
    }
    dp[0].insert(0);
    for (int i = 1; i <= n; i++)
    {
        set<int> nw;
        for (auto s : dp[0])
        {
            nw.insert(s + a[i]);
        }
        dp[0].insert(nw.begin(), nw.end());
    }
    if (dp[0].count(sum / 2) == 0)
    {
        cout << 0 << endl;
        return;
    }
    for (int k = 1; k <= n; k++)
    {
        dp[k].insert(0);
        for (int i = 1; i <= n; i++)
        {
            if (i == k)
                continue;
            set<int> nw;
            for (auto s : dp[k])
            {
                nw.insert(s + a[i]);
            }
            dp[k].insert(nw.begin(), nw.end());
        }
        int ns = sum - a[k];
        set<int> nt;
        for (auto s : dp[k])
        {
            int kx = ns - 2 * s;
            if (kx >= 0)
            {
                nt.insert(kx);
            }
        }
        dp[k] = nt;
    }
    set<int> ans = dp[1];
    for (int i = 2; i <= n; i++)
    {
        for (auto s : ans)
        {
            if (dp[i].count(s) == 0)
                ans.erase(s);
        }
    }
    cout << ans.size() << endl;
    for (auto s : ans)
    {
        cout << s << ' ';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -