oj.uz

Submission #173529

# Submission time Handle Problem Language Result Execution time Memory
173529 2020-01-04T13:30:57 Z srvlt Bootfall (IZhO17_bootfall) C++14
28 / 100
 1000 ms 632 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree <pair <int, int>, null_type, less <pair <int, int> >, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;

#define ll long long
#define db double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define size(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define low_b lower_bound

#define endl "\n"
//#define int long long

using namespace std;

void dout() {
    cerr << endl;
}
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;

const int N = 503, M = 250001;
int n, a[N];
bitset <M> sack, res, ans;

void solve(int tc) {
    // check for (int i = 0; i < n; j++)
    cin >> n;
    int total = 0;
    sack[0] = 1;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        total += a[i];
        sack |= (sack << a[i]);
    }
    if ((total & 1) || !sack[total >> 1]) {
        cout << 0;
        return;
    }
    int cur;
    ans.set();
    for (int i = 1; i <= n; i++) {
        sack.reset();
        res.reset();

        sack[0] = 1;
        for (int j = 1; j <= n; j++) {
            if (i == j) {
                continue;
            }
            sack |= (sack << a[j]);
        }
        cur = total - a[i];
        for (int j = cur & 1; j <= cur; j += 2) {
            if (sack[cur + j >> 1] || sack[cur - j >> 1]) {
                res[j] = 1;
            }
        }
        ans &= res;
    }
    cout << ans.count() << endl;
    for (int i = 0; i < M; i++) {
        if (ans[i]) {
            cout << i << " ";
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Compilation message

bootfall.cpp: In function 'void solve(int)':
bootfall.cpp:71:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
             if (sack[cur + j >> 1] || sack[cur - j >> 1]) {
                      ~~~~^~~
bootfall.cpp:71:48: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
             if (sack[cur + j >> 1] || sack[cur - j >> 1]) {
                                            ~~~~^~~

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 4 ms 508 KB Output is correct
10 Correct 15 ms 504 KB Output is correct
11 Correct 14 ms 504 KB Output is correct
12 Correct 15 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 13 ms 504 KB Output is correct
15 Correct 14 ms 508 KB Output is correct
16 Correct 15 ms 504 KB Output is correct
17 Correct 7 ms 504 KB Output is correct
18 Correct 10 ms 504 KB Output is correct
19 Correct 12 ms 504 KB Output is correct
20 Correct 15 ms 632 KB Output is correct
21 Correct 57 ms 504 KB Output is correct
22 Correct 76 ms 504 KB Output is correct
23 Correct 37 ms 632 KB Output is correct
24 Correct 121 ms 504 KB Output is correct
25 Correct 122 ms 504 KB Output is correct
26 Correct 139 ms 508 KB Output is correct
27 Correct 140 ms 504 KB Output is correct
28 Correct 140 ms 604 KB Output is correct
29 Correct 136 ms 504 KB Output is correct
30 Correct 135 ms 504 KB Output is correct
31 Correct 137 ms 632 KB Output is correct
32 Correct 137 ms 532 KB Output is correct
33 Correct 138 ms 504 KB Output is correct
34 Correct 138 ms 504 KB Output is correct
35 Correct 136 ms 528 KB Output is correct
36 Correct 135 ms 632 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 4 ms 508 KB Output is correct
10 Correct 15 ms 504 KB Output is correct
11 Correct 14 ms 504 KB Output is correct
12 Correct 15 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 13 ms 504 KB Output is correct
15 Correct 14 ms 508 KB Output is correct
16 Correct 15 ms 504 KB Output is correct
17 Correct 7 ms 504 KB Output is correct
18 Correct 10 ms 504 KB Output is correct
19 Correct 12 ms 504 KB Output is correct
20 Correct 15 ms 632 KB Output is correct
21 Correct 57 ms 504 KB Output is correct
22 Correct 76 ms 504 KB Output is correct
23 Correct 37 ms 632 KB Output is correct
24 Correct 121 ms 504 KB Output is correct
25 Correct 122 ms 504 KB Output is correct
26 Correct 139 ms 508 KB Output is correct
27 Correct 140 ms 504 KB Output is correct
28 Correct 140 ms 604 KB Output is correct
29 Correct 136 ms 504 KB Output is correct
30 Correct 135 ms 504 KB Output is correct
31 Correct 137 ms 632 KB Output is correct
32 Correct 137 ms 532 KB Output is correct
33 Correct 138 ms 504 KB Output is correct
34 Correct 138 ms 504 KB Output is correct
35 Correct 136 ms 528 KB Output is correct
36 Correct 135 ms 632 KB Output is correct
37 Correct 543 ms 536 KB Output is correct
38 Correct 543 ms 632 KB Output is correct
39 Correct 836 ms 632 KB Output is correct
40 Correct 978 ms 632 KB Output is correct
41 Execution timed out 1008 ms 524 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 4 ms 508 KB Output is correct
10 Correct 15 ms 504 KB Output is correct
11 Correct 14 ms 504 KB Output is correct
12 Correct 15 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 13 ms 504 KB Output is correct
15 Correct 14 ms 508 KB Output is correct
16 Correct 15 ms 504 KB Output is correct
17 Correct 7 ms 504 KB Output is correct
18 Correct 10 ms 504 KB Output is correct
19 Correct 12 ms 504 KB Output is correct
20 Correct 15 ms 632 KB Output is correct
21 Correct 57 ms 504 KB Output is correct
22 Correct 76 ms 504 KB Output is correct
23 Correct 37 ms 632 KB Output is correct
24 Correct 121 ms 504 KB Output is correct
25 Correct 122 ms 504 KB Output is correct
26 Correct 139 ms 508 KB Output is correct
27 Correct 140 ms 504 KB Output is correct
28 Correct 140 ms 604 KB Output is correct
29 Correct 136 ms 504 KB Output is correct
30 Correct 135 ms 504 KB Output is correct
31 Correct 137 ms 632 KB Output is correct
32 Correct 137 ms 532 KB Output is correct
33 Correct 138 ms 504 KB Output is correct
34 Correct 138 ms 504 KB Output is correct
35 Correct 136 ms 528 KB Output is correct
36 Correct 135 ms 632 KB Output is correct
37 Correct 543 ms 536 KB Output is correct
38 Correct 543 ms 632 KB Output is correct
39 Correct 836 ms 632 KB Output is correct
40 Correct 978 ms 632 KB Output is correct
41 Execution timed out 1008 ms 524 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 4 ms 508 KB Output is correct
10 Correct 15 ms 504 KB Output is correct
11 Correct 14 ms 504 KB Output is correct
12 Correct 15 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 13 ms 504 KB Output is correct
15 Correct 14 ms 508 KB Output is correct
16 Correct 15 ms 504 KB Output is correct
17 Correct 7 ms 504 KB Output is correct
18 Correct 10 ms 504 KB Output is correct
19 Correct 12 ms 504 KB Output is correct
20 Correct 15 ms 632 KB Output is correct
21 Correct 57 ms 504 KB Output is correct
22 Correct 76 ms 504 KB Output is correct
23 Correct 37 ms 632 KB Output is correct
24 Correct 121 ms 504 KB Output is correct
25 Correct 122 ms 504 KB Output is correct
26 Correct 139 ms 508 KB Output is correct
27 Correct 140 ms 504 KB Output is correct
28 Correct 140 ms 604 KB Output is correct
29 Correct 136 ms 504 KB Output is correct
30 Correct 135 ms 504 KB Output is correct
31 Correct 137 ms 632 KB Output is correct
32 Correct 137 ms 532 KB Output is correct
33 Correct 138 ms 504 KB Output is correct
34 Correct 138 ms 504 KB Output is correct
35 Correct 136 ms 528 KB Output is correct
36 Correct 135 ms 632 KB Output is correct
37 Correct 543 ms 536 KB Output is correct
38 Correct 543 ms 632 KB Output is correct
39 Correct 836 ms 632 KB Output is correct
40 Correct 978 ms 632 KB Output is correct
41 Execution timed out 1008 ms 524 KB Time limit exceeded
42 Halted 0 ms 0 KB -