oj.uz

Submission #502688

# Submission time Handle Problem Language Result Execution time Memory
502688 2022-01-06T12:48:33 Z tox1c_kid Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 1536 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> used(sum + 1);
    for (int i = 0; i < n; i++) {
        bitset<500 * 500 + 1> dp;
        dp[0] = 1;
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            dp |= (dp << a[j]);
        }
//        cout << dp << "\n";
        for (int j = 1; j <= sum; j++) {
            int cur = 2 * j - sum + a[i];
            if (cur > 0 && dp[j]) used[cur]++;
        }
    }
    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 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 1 ms 332 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 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 7 ms 332 KB Output is correct
11 Correct 7 ms 428 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 6 ms 436 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Correct 5 ms 332 KB Output is correct
20 Correct 7 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 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 7 ms 332 KB Output is correct
11 Correct 7 ms 428 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 6 ms 436 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Correct 5 ms 332 KB Output is correct
20 Correct 7 ms 332 KB Output is correct
21 Correct 28 ms 416 KB Output is correct
22 Correct 39 ms 432 KB Output is correct
23 Correct 23 ms 440 KB Output is correct
24 Correct 65 ms 432 KB Output is correct
25 Correct 66 ms 460 KB Output is correct
26 Correct 67 ms 460 KB Output is correct
27 Correct 68 ms 460 KB Output is correct
28 Correct 72 ms 460 KB Output is correct
29 Correct 69 ms 460 KB Output is correct
30 Correct 79 ms 432 KB Output is correct
31 Correct 67 ms 440 KB Output is correct
32 Correct 67 ms 440 KB Output is correct
33 Correct 67 ms 460 KB Output is correct
34 Correct 69 ms 460 KB Output is correct
35 Correct 70 ms 460 KB Output is correct
36 Correct 72 ms 452 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 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 7 ms 332 KB Output is correct
11 Correct 7 ms 428 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 6 ms 436 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Correct 5 ms 332 KB Output is correct
20 Correct 7 ms 332 KB Output is correct
21 Correct 28 ms 416 KB Output is correct
22 Correct 39 ms 432 KB Output is correct
23 Correct 23 ms 440 KB Output is correct
24 Correct 65 ms 432 KB Output is correct
25 Correct 66 ms 460 KB Output is correct
26 Correct 67 ms 460 KB Output is correct
27 Correct 68 ms 460 KB Output is correct
28 Correct 72 ms 460 KB Output is correct
29 Correct 69 ms 460 KB Output is correct
30 Correct 79 ms 432 KB Output is correct
31 Correct 67 ms 440 KB Output is correct
32 Correct 67 ms 440 KB Output is correct
33 Correct 67 ms 460 KB Output is correct
34 Correct 69 ms 460 KB Output is correct
35 Correct 70 ms 460 KB Output is correct
36 Correct 72 ms 452 KB Output is correct
37 Correct 271 ms 616 KB Output is correct
38 Correct 278 ms 620 KB Output is correct
39 Correct 422 ms 708 KB Output is correct
40 Correct 493 ms 664 KB Output is correct
41 Correct 507 ms 836 KB Output is correct
42 Correct 435 ms 708 KB Output is correct
43 Correct 418 ms 904 KB Output is correct
44 Correct 439 ms 1036 KB Output is correct
45 Correct 457 ms 964 KB Output is correct
46 Correct 495 ms 540 KB Output is correct
47 Correct 428 ms 680 KB Output is correct
48 Correct 449 ms 928 KB Output is correct
49 Correct 443 ms 668 KB Output is correct
50 Correct 439 ms 680 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 557 ms 1080 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 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 7 ms 332 KB Output is correct
11 Correct 7 ms 428 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 6 ms 436 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Correct 5 ms 332 KB Output is correct
20 Correct 7 ms 332 KB Output is correct
21 Correct 28 ms 416 KB Output is correct
22 Correct 39 ms 432 KB Output is correct
23 Correct 23 ms 440 KB Output is correct
24 Correct 65 ms 432 KB Output is correct
25 Correct 66 ms 460 KB Output is correct
26 Correct 67 ms 460 KB Output is correct
27 Correct 68 ms 460 KB Output is correct
28 Correct 72 ms 460 KB Output is correct
29 Correct 69 ms 460 KB Output is correct
30 Correct 79 ms 432 KB Output is correct
31 Correct 67 ms 440 KB Output is correct
32 Correct 67 ms 440 KB Output is correct
33 Correct 67 ms 460 KB Output is correct
34 Correct 69 ms 460 KB Output is correct
35 Correct 70 ms 460 KB Output is correct
36 Correct 72 ms 452 KB Output is correct
37 Correct 271 ms 616 KB Output is correct
38 Correct 278 ms 620 KB Output is correct
39 Correct 422 ms 708 KB Output is correct
40 Correct 493 ms 664 KB Output is correct
41 Correct 507 ms 836 KB Output is correct
42 Correct 435 ms 708 KB Output is correct
43 Correct 418 ms 904 KB Output is correct
44 Correct 439 ms 1036 KB Output is correct
45 Correct 457 ms 964 KB Output is correct
46 Correct 495 ms 540 KB Output is correct
47 Correct 428 ms 680 KB Output is correct
48 Correct 449 ms 928 KB Output is correct
49 Correct 443 ms 668 KB Output is correct
50 Correct 439 ms 680 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 557 ms 1080 KB Output is correct
53 Correct 616 ms 864 KB Output is correct
54 Correct 879 ms 1036 KB Output is correct
55 Correct 930 ms 1388 KB Output is correct
56 Correct 678 ms 1036 KB Output is correct
57 Correct 882 ms 1536 KB Output is correct
58 Correct 855 ms 1092 KB Output is correct
59 Correct 868 ms 1112 KB Output is correct
60 Correct 3 ms 332 KB Output is correct
61 Correct 884 ms 1276 KB Output is correct
62 Correct 742 ms 1316 KB Output is correct
63 Correct 761 ms 1352 KB Output is correct
64 Correct 715 ms 1344 KB Output is correct
65 Correct 681 ms 628 KB Output is correct
66 Correct 644 ms 632 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 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 7 ms 332 KB Output is correct
11 Correct 7 ms 428 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 6 ms 436 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Correct 5 ms 332 KB Output is correct
20 Correct 7 ms 332 KB Output is correct
21 Correct 28 ms 416 KB Output is correct
22 Correct 39 ms 432 KB Output is correct
23 Correct 23 ms 440 KB Output is correct
24 Correct 65 ms 432 KB Output is correct
25 Correct 66 ms 460 KB Output is correct
26 Correct 67 ms 460 KB Output is correct
27 Correct 68 ms 460 KB Output is correct
28 Correct 72 ms 460 KB Output is correct
29 Correct 69 ms 460 KB Output is correct
30 Correct 79 ms 432 KB Output is correct
31 Correct 67 ms 440 KB Output is correct
32 Correct 67 ms 440 KB Output is correct
33 Correct 67 ms 460 KB Output is correct
34 Correct 69 ms 460 KB Output is correct
35 Correct 70 ms 460 KB Output is correct
36 Correct 72 ms 452 KB Output is correct
37 Correct 271 ms 616 KB Output is correct
38 Correct 278 ms 620 KB Output is correct
39 Correct 422 ms 708 KB Output is correct
40 Correct 493 ms 664 KB Output is correct
41 Correct 507 ms 836 KB Output is correct
42 Correct 435 ms 708 KB Output is correct
43 Correct 418 ms 904 KB Output is correct
44 Correct 439 ms 1036 KB Output is correct
45 Correct 457 ms 964 KB Output is correct
46 Correct 495 ms 540 KB Output is correct
47 Correct 428 ms 680 KB Output is correct
48 Correct 449 ms 928 KB Output is correct
49 Correct 443 ms 668 KB Output is correct
50 Correct 439 ms 680 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 557 ms 1080 KB Output is correct
53 Correct 616 ms 864 KB Output is correct
54 Correct 879 ms 1036 KB Output is correct
55 Correct 930 ms 1388 KB Output is correct
56 Correct 678 ms 1036 KB Output is correct
57 Correct 882 ms 1536 KB Output is correct
58 Correct 855 ms 1092 KB Output is correct
59 Correct 868 ms 1112 KB Output is correct
60 Correct 3 ms 332 KB Output is correct
61 Correct 884 ms 1276 KB Output is correct
62 Correct 742 ms 1316 KB Output is correct
63 Correct 761 ms 1352 KB Output is correct
64 Correct 715 ms 1344 KB Output is correct
65 Correct 681 ms 628 KB Output is correct
66 Correct 644 ms 632 KB Output is correct
67 Execution timed out 1095 ms 716 KB Time limit exceeded
68 Halted 0 ms 0 KB -