oj.uz

Submission #502683

# Submission time Handle Problem Language Result Execution time Memory
502683 2022-01-06T12:41:31 Z tox1c_kid Bootfall (IZhO17_bootfall) C++17
65 / 100
 583 ms 2252 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<350 * 350 + 10> 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<350 * 350 + 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 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 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 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 368 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 372 KB Output is correct
14 Correct 3 ms 372 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 368 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 372 KB Output is correct
14 Correct 3 ms 372 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 13 ms 380 KB Output is correct
22 Correct 18 ms 384 KB Output is correct
23 Correct 8 ms 372 KB Output is correct
24 Correct 32 ms 380 KB Output is correct
25 Correct 33 ms 400 KB Output is correct
26 Correct 35 ms 460 KB Output is correct
27 Correct 33 ms 396 KB Output is correct
28 Correct 33 ms 396 KB Output is correct
29 Correct 34 ms 392 KB Output is correct
30 Correct 33 ms 372 KB Output is correct
31 Correct 33 ms 392 KB Output is correct
32 Correct 34 ms 372 KB Output is correct
33 Correct 32 ms 368 KB Output is correct
34 Correct 34 ms 372 KB Output is correct
35 Correct 38 ms 408 KB Output is correct
36 Correct 36 ms 368 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 368 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 372 KB Output is correct
14 Correct 3 ms 372 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 13 ms 380 KB Output is correct
22 Correct 18 ms 384 KB Output is correct
23 Correct 8 ms 372 KB Output is correct
24 Correct 32 ms 380 KB Output is correct
25 Correct 33 ms 400 KB Output is correct
26 Correct 35 ms 460 KB Output is correct
27 Correct 33 ms 396 KB Output is correct
28 Correct 33 ms 396 KB Output is correct
29 Correct 34 ms 392 KB Output is correct
30 Correct 33 ms 372 KB Output is correct
31 Correct 33 ms 392 KB Output is correct
32 Correct 34 ms 372 KB Output is correct
33 Correct 32 ms 368 KB Output is correct
34 Correct 34 ms 372 KB Output is correct
35 Correct 38 ms 408 KB Output is correct
36 Correct 36 ms 368 KB Output is correct
37 Correct 132 ms 580 KB Output is correct
38 Correct 136 ms 556 KB Output is correct
39 Correct 209 ms 588 KB Output is correct
40 Correct 245 ms 608 KB Output is correct
41 Correct 243 ms 648 KB Output is correct
42 Correct 246 ms 604 KB Output is correct
43 Correct 210 ms 844 KB Output is correct
44 Correct 219 ms 964 KB Output is correct
45 Correct 224 ms 972 KB Output is correct
46 Correct 235 ms 460 KB Output is correct
47 Correct 209 ms 616 KB Output is correct
48 Correct 239 ms 872 KB Output is correct
49 Correct 217 ms 608 KB Output is correct
50 Correct 210 ms 608 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 266 ms 1024 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 368 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 372 KB Output is correct
14 Correct 3 ms 372 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 13 ms 380 KB Output is correct
22 Correct 18 ms 384 KB Output is correct
23 Correct 8 ms 372 KB Output is correct
24 Correct 32 ms 380 KB Output is correct
25 Correct 33 ms 400 KB Output is correct
26 Correct 35 ms 460 KB Output is correct
27 Correct 33 ms 396 KB Output is correct
28 Correct 33 ms 396 KB Output is correct
29 Correct 34 ms 392 KB Output is correct
30 Correct 33 ms 372 KB Output is correct
31 Correct 33 ms 392 KB Output is correct
32 Correct 34 ms 372 KB Output is correct
33 Correct 32 ms 368 KB Output is correct
34 Correct 34 ms 372 KB Output is correct
35 Correct 38 ms 408 KB Output is correct
36 Correct 36 ms 368 KB Output is correct
37 Correct 132 ms 580 KB Output is correct
38 Correct 136 ms 556 KB Output is correct
39 Correct 209 ms 588 KB Output is correct
40 Correct 245 ms 608 KB Output is correct
41 Correct 243 ms 648 KB Output is correct
42 Correct 246 ms 604 KB Output is correct
43 Correct 210 ms 844 KB Output is correct
44 Correct 219 ms 964 KB Output is correct
45 Correct 224 ms 972 KB Output is correct
46 Correct 235 ms 460 KB Output is correct
47 Correct 209 ms 616 KB Output is correct
48 Correct 239 ms 872 KB Output is correct
49 Correct 217 ms 608 KB Output is correct
50 Correct 210 ms 608 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 266 ms 1024 KB Output is correct
53 Correct 305 ms 800 KB Output is correct
54 Correct 445 ms 972 KB Output is correct
55 Correct 457 ms 1388 KB Output is correct
56 Correct 343 ms 964 KB Output is correct
57 Correct 452 ms 1480 KB Output is correct
58 Correct 420 ms 968 KB Output is correct
59 Correct 441 ms 1068 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 433 ms 1248 KB Output is correct
62 Correct 405 ms 1256 KB Output is correct
63 Correct 377 ms 1288 KB Output is correct
64 Correct 441 ms 1276 KB Output is correct
65 Correct 322 ms 496 KB Output is correct
66 Correct 340 ms 572 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 368 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 372 KB Output is correct
14 Correct 3 ms 372 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 368 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 13 ms 380 KB Output is correct
22 Correct 18 ms 384 KB Output is correct
23 Correct 8 ms 372 KB Output is correct
24 Correct 32 ms 380 KB Output is correct
25 Correct 33 ms 400 KB Output is correct
26 Correct 35 ms 460 KB Output is correct
27 Correct 33 ms 396 KB Output is correct
28 Correct 33 ms 396 KB Output is correct
29 Correct 34 ms 392 KB Output is correct
30 Correct 33 ms 372 KB Output is correct
31 Correct 33 ms 392 KB Output is correct
32 Correct 34 ms 372 KB Output is correct
33 Correct 32 ms 368 KB Output is correct
34 Correct 34 ms 372 KB Output is correct
35 Correct 38 ms 408 KB Output is correct
36 Correct 36 ms 368 KB Output is correct
37 Correct 132 ms 580 KB Output is correct
38 Correct 136 ms 556 KB Output is correct
39 Correct 209 ms 588 KB Output is correct
40 Correct 245 ms 608 KB Output is correct
41 Correct 243 ms 648 KB Output is correct
42 Correct 246 ms 604 KB Output is correct
43 Correct 210 ms 844 KB Output is correct
44 Correct 219 ms 964 KB Output is correct
45 Correct 224 ms 972 KB Output is correct
46 Correct 235 ms 460 KB Output is correct
47 Correct 209 ms 616 KB Output is correct
48 Correct 239 ms 872 KB Output is correct
49 Correct 217 ms 608 KB Output is correct
50 Correct 210 ms 608 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 266 ms 1024 KB Output is correct
53 Correct 305 ms 800 KB Output is correct
54 Correct 445 ms 972 KB Output is correct
55 Correct 457 ms 1388 KB Output is correct
56 Correct 343 ms 964 KB Output is correct
57 Correct 452 ms 1480 KB Output is correct
58 Correct 420 ms 968 KB Output is correct
59 Correct 441 ms 1068 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 433 ms 1248 KB Output is correct
62 Correct 405 ms 1256 KB Output is correct
63 Correct 377 ms 1288 KB Output is correct
64 Correct 441 ms 1276 KB Output is correct
65 Correct 322 ms 496 KB Output is correct
66 Correct 340 ms 572 KB Output is correct
67 Correct 583 ms 1192 KB Output is correct
68 Correct 2 ms 332 KB Output is correct
69 Runtime error 6 ms 2252 KB Execution killed with signal 11
70 Halted 0 ms 0 KB -