oj.uz

Submission #502776

# Submission time Handle Problem Language Result Execution time Memory
502776 2022-01-06T15:07:20 Z tox1c_kid Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 1996 KB 
#include <iostream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <sstream>
#include <cassert>
#include <vector>
#include <numeric>
#include <string>
#include <bitset>
#include <cmath>
#include <complex>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <random>
#include <chrono>
#include <ctime>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>

/*
 ⠄⠄⠄⢰⣧⣼⣯⠄⣸⣠⣶⣶⣦⣾⠄⠄⠄⠄⡀⠄⢀⣿⣿⠄⠄⠄⢸⡇⠄⠄
⠄⠄⠄⣾⣿⠿⠿⠶⠿⢿⣿⣿⣿⣿⣦⣤⣄⢀⡅⢠⣾⣛⡉⠄⠄⠄⠸⢀⣿⠄
⠄⠄⢀⡋⣡⣴⣶⣶⡀⠄⠄⠙⢿⣿⣿⣿⣿⣿⣴⣿⣿⣿⢃⣤⣄⣀⣥⣿⣿⠄
⠄⠄⢸⣇⠻⣿⣿⣿⣧⣀⢀⣠⡌⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⣿⣿⣿⠄
⠄⢀⢸⣿⣷⣤⣤⣤⣬⣙⣛⢿⣿⣿⣿⣿⣿⣿⡿⣿⣿⡍⠄⠄⢀⣤⣄⠉⠋⣰
⠄⣼⣖⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⣿⣿⣿⣿⣿⢇⣿⣿⡷⠶⠶⢿⣿⣿⠇⢀⣤
⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣽⣿⣿⣿⡇⣿⣿⣿⣿⣿⣿⣷⣶⣥⣴⣿⡗
⢀⠈⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡟⠄
⢸⣿⣦⣌⣛⣻⣿⣿⣧⠙⠛⠛⡭⠅⠒⠦⠭⣭⡻⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⠄
⠘⣿⣿⣿⣿⣿⣿⣿⣿⡆⠄⠄⠄⠄⠄⠄⠄⠄⠹⠈⢋⣽⣿⣿⣿⣿⣵⣾⠃⠄
⠄⠘⣿⣿⣿⣿⣿⣿⣿⣿⠄⣴⣿⣶⣄⠄⣴⣶⠄⢀⣾⣿⣿⣿⣿⣿⣿⠃⠄⠄
⠄⠄⠈⠻⣿⣿⣿⣿⣿⣿⡄⢻⣿⣿⣿⠄⣿⣿⡀⣾⣿⣿⣿⣿⣛⠛⠁⠄⠄⠄
⠄⠄⠄⠄⠈⠛⢿⣿⣿⣿⠁⠞⢿⣿⣿⡄⢿⣿⡇⣸⣿⣿⠿⠛⠁⠄⠄⠄⠄⠄
⠄⠄⠄⠄⠄⠄⠄⠉⠻⣿⣿⣾⣦⡙⠻⣷⣾⣿⠃⠿⠋⠁⠄⠄⠄⠄⠄⢀⣠⣴
⣿⣿⣿⣶⣶⣮⣥⣒⠲⢮⣝⡿⣿⣿⡆⣿⡿⠃⠄⠄⠄⠄⠄⠄⠄⣠⣴⣿⣿⣿
 */

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define all(x) (x).begin(), (x).end()
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
    return '"' + s + '"';
}

string to_string(const char* s) {
    return to_string((string) s);
}

string to_string(vector<bool> v) {
    bool first = true;
    string res = "{";
    for (int i = 0; i < static_cast<int>(v.size()); i++) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(v[i]);
    }
    res += "}";
    return res;
}

template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cout << "\n"; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cout << " " << to_string(H);
    debug_out(T...);
}

#ifdef CLOWN
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
#else
#define dbg(...);
#endif

int test = 0;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<int> ans;
    bitset<500 * 500 + 1> dp1;
    dp1[0] = 1;
    for (int i = 0; i < n; i++) {
        dp1 |= (dp1 << a[i]);
    }
    dbg(accumulate(all(a), 0))
    if (!dp1[accumulate(all(a), 0) / 2] || accumulate(all(a), 0) % 2) {
        cout << 0 << "\n";
        return;
    }

    int sum = accumulate(all(a), 0);

    vector<int> dp(sum + 1);
    dp[0] = 1;

    for (int i =0 ; i < n;i++) {
        for (int j = sum; j >= 0; j--) {
            if (j + a[i] <= sum) {
                dp[j + a[i]] += dp[j];
            }
        }
    }

    vector<int> used(sum + 3);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= sum - a[i]; j++) {
            dp[j + a[i]] -= dp[j];
        }

        for (int j = 1; j <= sum; j++) {
            int cur = sum - a[i] + j;
            if (cur % 2) continue;
            if (cur <= 0) continue;
            if (dp[cur / 2]) used[j]++;
        }
        for (int j = sum - a[i]; j >= 0; j--) {
            dp[j + a[i]] += dp[j];
        }
    }
    dbg(used)
    for (int i = 1; i < sum + 1; i++) {
        if (used[i] == n) {
            ans.push_back(i);
        }
    }
    cout << ans.size() << "\n";
    for (auto i : ans) cout << i << " ";
}

int32_t main() {
#ifdef CLOWN
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t = 1;
    fastio();
    if (test) cin >> t;
    while (t--) { solve(); }
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 404 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 404 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 404 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 4 ms 460 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 6 ms 460 KB Output is correct
25 Correct 11 ms 460 KB Output is correct
26 Correct 12 ms 440 KB Output is correct
27 Correct 11 ms 476 KB Output is correct
28 Correct 12 ms 460 KB Output is correct
29 Correct 12 ms 476 KB Output is correct
30 Correct 7 ms 444 KB Output is correct
31 Correct 10 ms 460 KB Output is correct
32 Correct 7 ms 436 KB Output is correct
33 Correct 12 ms 484 KB Output is correct
34 Correct 12 ms 484 KB Output is correct
35 Correct 12 ms 476 KB Output is correct
36 Correct 7 ms 432 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 404 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 4 ms 460 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 6 ms 460 KB Output is correct
25 Correct 11 ms 460 KB Output is correct
26 Correct 12 ms 440 KB Output is correct
27 Correct 11 ms 476 KB Output is correct
28 Correct 12 ms 460 KB Output is correct
29 Correct 12 ms 476 KB Output is correct
30 Correct 7 ms 444 KB Output is correct
31 Correct 10 ms 460 KB Output is correct
32 Correct 7 ms 436 KB Output is correct
33 Correct 12 ms 484 KB Output is correct
34 Correct 12 ms 484 KB Output is correct
35 Correct 12 ms 476 KB Output is correct
36 Correct 7 ms 432 KB Output is correct
37 Correct 48 ms 724 KB Output is correct
38 Correct 46 ms 780 KB Output is correct
39 Correct 163 ms 768 KB Output is correct
40 Correct 93 ms 836 KB Output is correct
41 Correct 208 ms 1092 KB Output is correct
42 Correct 90 ms 776 KB Output is correct
43 Correct 137 ms 1212 KB Output is correct
44 Correct 145 ms 1220 KB Output is correct
45 Correct 163 ms 1144 KB Output is correct
46 Correct 92 ms 636 KB Output is correct
47 Correct 87 ms 764 KB Output is correct
48 Correct 160 ms 1128 KB Output is correct
49 Correct 180 ms 912 KB Output is correct
50 Correct 86 ms 768 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 198 ms 1336 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 404 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 4 ms 460 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 6 ms 460 KB Output is correct
25 Correct 11 ms 460 KB Output is correct
26 Correct 12 ms 440 KB Output is correct
27 Correct 11 ms 476 KB Output is correct
28 Correct 12 ms 460 KB Output is correct
29 Correct 12 ms 476 KB Output is correct
30 Correct 7 ms 444 KB Output is correct
31 Correct 10 ms 460 KB Output is correct
32 Correct 7 ms 436 KB Output is correct
33 Correct 12 ms 484 KB Output is correct
34 Correct 12 ms 484 KB Output is correct
35 Correct 12 ms 476 KB Output is correct
36 Correct 7 ms 432 KB Output is correct
37 Correct 48 ms 724 KB Output is correct
38 Correct 46 ms 780 KB Output is correct
39 Correct 163 ms 768 KB Output is correct
40 Correct 93 ms 836 KB Output is correct
41 Correct 208 ms 1092 KB Output is correct
42 Correct 90 ms 776 KB Output is correct
43 Correct 137 ms 1212 KB Output is correct
44 Correct 145 ms 1220 KB Output is correct
45 Correct 163 ms 1144 KB Output is correct
46 Correct 92 ms 636 KB Output is correct
47 Correct 87 ms 764 KB Output is correct
48 Correct 160 ms 1128 KB Output is correct
49 Correct 180 ms 912 KB Output is correct
50 Correct 86 ms 768 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 198 ms 1336 KB Output is correct
53 Correct 150 ms 1100 KB Output is correct
54 Correct 215 ms 1132 KB Output is correct
55 Correct 403 ms 1804 KB Output is correct
56 Correct 199 ms 1220 KB Output is correct
57 Correct 438 ms 1884 KB Output is correct
58 Correct 245 ms 1276 KB Output is correct
59 Correct 291 ms 1388 KB Output is correct
60 Correct 3 ms 404 KB Output is correct
61 Correct 328 ms 1508 KB Output is correct
62 Correct 342 ms 1664 KB Output is correct
63 Correct 323 ms 1708 KB Output is correct
64 Correct 347 ms 1740 KB Output is correct
65 Correct 160 ms 780 KB Output is correct
66 Correct 172 ms 808 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 404 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 4 ms 460 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 6 ms 460 KB Output is correct
25 Correct 11 ms 460 KB Output is correct
26 Correct 12 ms 440 KB Output is correct
27 Correct 11 ms 476 KB Output is correct
28 Correct 12 ms 460 KB Output is correct
29 Correct 12 ms 476 KB Output is correct
30 Correct 7 ms 444 KB Output is correct
31 Correct 10 ms 460 KB Output is correct
32 Correct 7 ms 436 KB Output is correct
33 Correct 12 ms 484 KB Output is correct
34 Correct 12 ms 484 KB Output is correct
35 Correct 12 ms 476 KB Output is correct
36 Correct 7 ms 432 KB Output is correct
37 Correct 48 ms 724 KB Output is correct
38 Correct 46 ms 780 KB Output is correct
39 Correct 163 ms 768 KB Output is correct
40 Correct 93 ms 836 KB Output is correct
41 Correct 208 ms 1092 KB Output is correct
42 Correct 90 ms 776 KB Output is correct
43 Correct 137 ms 1212 KB Output is correct
44 Correct 145 ms 1220 KB Output is correct
45 Correct 163 ms 1144 KB Output is correct
46 Correct 92 ms 636 KB Output is correct
47 Correct 87 ms 764 KB Output is correct
48 Correct 160 ms 1128 KB Output is correct
49 Correct 180 ms 912 KB Output is correct
50 Correct 86 ms 768 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 198 ms 1336 KB Output is correct
53 Correct 150 ms 1100 KB Output is correct
54 Correct 215 ms 1132 KB Output is correct
55 Correct 403 ms 1804 KB Output is correct
56 Correct 199 ms 1220 KB Output is correct
57 Correct 438 ms 1884 KB Output is correct
58 Correct 245 ms 1276 KB Output is correct
59 Correct 291 ms 1388 KB Output is correct
60 Correct 3 ms 404 KB Output is correct
61 Correct 328 ms 1508 KB Output is correct
62 Correct 342 ms 1664 KB Output is correct
63 Correct 323 ms 1708 KB Output is correct
64 Correct 347 ms 1740 KB Output is correct
65 Correct 160 ms 780 KB Output is correct
66 Correct 172 ms 808 KB Output is correct
67 Correct 337 ms 1548 KB Output is correct
68 Correct 4 ms 404 KB Output is correct
69 Execution timed out 1079 ms 1996 KB Time limit exceeded
70 Halted 0 ms 0 KB -