oj.uz

Submission #58459

# Submission time Handle Problem Language Result Execution time Memory
58459 2018-07-17T23:19:27 Z Benq Bootfall (IZhO17_bootfall) C++14
100 / 100
 604 ms 3220 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 500*500+1;

typedef array<int,MX> B;

int N, a[500];
bitset<MX> all;
B b;
int sum = 0;

void ad(B& b, int x) {
    sum += x;
    FORd(i,x,MX) {
        b[i] += b[i-x];
        if (b[i] >= MOD) b[i] -= MOD;
    }
}

void del(B& b, int x) { // b[i]+b[i-x] = b2[i], b[i] = b2[i]-b[i-x]
    sum -= x;
    FOR(i,x,MX) {
        b[i] -= b[i-x];
        if (b[i] < 0) b[i] += MOD;
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    all.flip();
    cin >> N;
    b[0] = 1;
    F0R(i,N) {
        cin >> a[i];
        ad(b,a[i]);
    }
    if (sum % 2 != 0 || !b[sum/2]) {
        cout << 0;
        exit(0);
    }
    F0R(i,N) {
        del(b,a[i]);
        bitset<MX> cur;
        for (int j = 0; 2*j < sum; ++j) if (b[j]) cur[sum-2*j] = 1;
        ad(b,a[i]);
        all &= cur;
    }
    vi v;
    FOR(i,1,MX) if (all[i]) v.pb(i);
    cout << sz(v) << "\n";
    for (int i: v) cout << i << " ";
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1400 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 4 ms 1452 KB Output is correct
4 Correct 7 ms 1452 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 9 ms 1620 KB Output is correct
8 Correct 15 ms 1728 KB Output is correct
9 Correct 12 ms 1728 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1400 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 4 ms 1452 KB Output is correct
4 Correct 7 ms 1452 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 9 ms 1620 KB Output is correct
8 Correct 15 ms 1728 KB Output is correct
9 Correct 12 ms 1728 KB Output is correct
10 Correct 32 ms 1744 KB Output is correct
11 Correct 42 ms 1744 KB Output is correct
12 Correct 36 ms 1744 KB Output is correct
13 Correct 45 ms 1744 KB Output is correct
14 Correct 38 ms 1744 KB Output is correct
15 Correct 33 ms 1744 KB Output is correct
16 Correct 34 ms 1744 KB Output is correct
17 Correct 21 ms 1744 KB Output is correct
18 Correct 27 ms 1744 KB Output is correct
19 Correct 29 ms 1744 KB Output is correct
20 Correct 30 ms 1744 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1400 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 4 ms 1452 KB Output is correct
4 Correct 7 ms 1452 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 9 ms 1620 KB Output is correct
8 Correct 15 ms 1728 KB Output is correct
9 Correct 12 ms 1728 KB Output is correct
10 Correct 32 ms 1744 KB Output is correct
11 Correct 42 ms 1744 KB Output is correct
12 Correct 36 ms 1744 KB Output is correct
13 Correct 45 ms 1744 KB Output is correct
14 Correct 38 ms 1744 KB Output is correct
15 Correct 33 ms 1744 KB Output is correct
16 Correct 34 ms 1744 KB Output is correct
17 Correct 21 ms 1744 KB Output is correct
18 Correct 27 ms 1744 KB Output is correct
19 Correct 29 ms 1744 KB Output is correct
20 Correct 30 ms 1744 KB Output is correct
21 Correct 81 ms 1744 KB Output is correct
22 Correct 71 ms 1744 KB Output is correct
23 Correct 48 ms 1744 KB Output is correct
24 Correct 172 ms 1744 KB Output is correct
25 Correct 171 ms 1744 KB Output is correct
26 Correct 96 ms 1744 KB Output is correct
27 Correct 91 ms 1744 KB Output is correct
28 Correct 97 ms 1744 KB Output is correct
29 Correct 90 ms 1744 KB Output is correct
30 Correct 92 ms 1784 KB Output is correct
31 Correct 94 ms 1820 KB Output is correct
32 Correct 93 ms 1820 KB Output is correct
33 Correct 96 ms 1820 KB Output is correct
34 Correct 93 ms 1944 KB Output is correct
35 Correct 104 ms 1944 KB Output is correct
36 Correct 103 ms 1944 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1400 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 4 ms 1452 KB Output is correct
4 Correct 7 ms 1452 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 9 ms 1620 KB Output is correct
8 Correct 15 ms 1728 KB Output is correct
9 Correct 12 ms 1728 KB Output is correct
10 Correct 32 ms 1744 KB Output is correct
11 Correct 42 ms 1744 KB Output is correct
12 Correct 36 ms 1744 KB Output is correct
13 Correct 45 ms 1744 KB Output is correct
14 Correct 38 ms 1744 KB Output is correct
15 Correct 33 ms 1744 KB Output is correct
16 Correct 34 ms 1744 KB Output is correct
17 Correct 21 ms 1744 KB Output is correct
18 Correct 27 ms 1744 KB Output is correct
19 Correct 29 ms 1744 KB Output is correct
20 Correct 30 ms 1744 KB Output is correct
21 Correct 81 ms 1744 KB Output is correct
22 Correct 71 ms 1744 KB Output is correct
23 Correct 48 ms 1744 KB Output is correct
24 Correct 172 ms 1744 KB Output is correct
25 Correct 171 ms 1744 KB Output is correct
26 Correct 96 ms 1744 KB Output is correct
27 Correct 91 ms 1744 KB Output is correct
28 Correct 97 ms 1744 KB Output is correct
29 Correct 90 ms 1744 KB Output is correct
30 Correct 92 ms 1784 KB Output is correct
31 Correct 94 ms 1820 KB Output is correct
32 Correct 93 ms 1820 KB Output is correct
33 Correct 96 ms 1820 KB Output is correct
34 Correct 93 ms 1944 KB Output is correct
35 Correct 104 ms 1944 KB Output is correct
36 Correct 103 ms 1944 KB Output is correct
37 Correct 194 ms 1944 KB Output is correct
38 Correct 185 ms 1944 KB Output is correct
39 Correct 247 ms 1944 KB Output is correct
40 Correct 314 ms 1944 KB Output is correct
41 Correct 281 ms 1944 KB Output is correct
42 Correct 246 ms 1944 KB Output is correct
43 Correct 254 ms 2128 KB Output is correct
44 Correct 286 ms 2128 KB Output is correct
45 Correct 249 ms 2128 KB Output is correct
46 Correct 246 ms 2128 KB Output is correct
47 Correct 258 ms 2128 KB Output is correct
48 Correct 266 ms 2220 KB Output is correct
49 Correct 283 ms 2220 KB Output is correct
50 Correct 269 ms 2220 KB Output is correct
51 Correct 76 ms 2220 KB Output is correct
52 Correct 304 ms 2220 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1400 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 4 ms 1452 KB Output is correct
4 Correct 7 ms 1452 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 9 ms 1620 KB Output is correct
8 Correct 15 ms 1728 KB Output is correct
9 Correct 12 ms 1728 KB Output is correct
10 Correct 32 ms 1744 KB Output is correct
11 Correct 42 ms 1744 KB Output is correct
12 Correct 36 ms 1744 KB Output is correct
13 Correct 45 ms 1744 KB Output is correct
14 Correct 38 ms 1744 KB Output is correct
15 Correct 33 ms 1744 KB Output is correct
16 Correct 34 ms 1744 KB Output is correct
17 Correct 21 ms 1744 KB Output is correct
18 Correct 27 ms 1744 KB Output is correct
19 Correct 29 ms 1744 KB Output is correct
20 Correct 30 ms 1744 KB Output is correct
21 Correct 81 ms 1744 KB Output is correct
22 Correct 71 ms 1744 KB Output is correct
23 Correct 48 ms 1744 KB Output is correct
24 Correct 172 ms 1744 KB Output is correct
25 Correct 171 ms 1744 KB Output is correct
26 Correct 96 ms 1744 KB Output is correct
27 Correct 91 ms 1744 KB Output is correct
28 Correct 97 ms 1744 KB Output is correct
29 Correct 90 ms 1744 KB Output is correct
30 Correct 92 ms 1784 KB Output is correct
31 Correct 94 ms 1820 KB Output is correct
32 Correct 93 ms 1820 KB Output is correct
33 Correct 96 ms 1820 KB Output is correct
34 Correct 93 ms 1944 KB Output is correct
35 Correct 104 ms 1944 KB Output is correct
36 Correct 103 ms 1944 KB Output is correct
37 Correct 194 ms 1944 KB Output is correct
38 Correct 185 ms 1944 KB Output is correct
39 Correct 247 ms 1944 KB Output is correct
40 Correct 314 ms 1944 KB Output is correct
41 Correct 281 ms 1944 KB Output is correct
42 Correct 246 ms 1944 KB Output is correct
43 Correct 254 ms 2128 KB Output is correct
44 Correct 286 ms 2128 KB Output is correct
45 Correct 249 ms 2128 KB Output is correct
46 Correct 246 ms 2128 KB Output is correct
47 Correct 258 ms 2128 KB Output is correct
48 Correct 266 ms 2220 KB Output is correct
49 Correct 283 ms 2220 KB Output is correct
50 Correct 269 ms 2220 KB Output is correct
51 Correct 76 ms 2220 KB Output is correct
52 Correct 304 ms 2220 KB Output is correct
53 Correct 319 ms 2220 KB Output is correct
54 Correct 389 ms 2228 KB Output is correct
55 Correct 408 ms 2252 KB Output is correct
56 Correct 293 ms 2252 KB Output is correct
57 Correct 397 ms 2364 KB Output is correct
58 Correct 395 ms 2364 KB Output is correct
59 Correct 451 ms 2364 KB Output is correct
60 Correct 113 ms 2364 KB Output is correct
61 Correct 381 ms 2376 KB Output is correct
62 Correct 316 ms 2376 KB Output is correct
63 Correct 349 ms 2376 KB Output is correct
64 Correct 328 ms 2376 KB Output is correct
65 Correct 328 ms 2376 KB Output is correct
66 Correct 425 ms 2376 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1400 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 4 ms 1452 KB Output is correct
4 Correct 7 ms 1452 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 9 ms 1620 KB Output is correct
8 Correct 15 ms 1728 KB Output is correct
9 Correct 12 ms 1728 KB Output is correct
10 Correct 32 ms 1744 KB Output is correct
11 Correct 42 ms 1744 KB Output is correct
12 Correct 36 ms 1744 KB Output is correct
13 Correct 45 ms 1744 KB Output is correct
14 Correct 38 ms 1744 KB Output is correct
15 Correct 33 ms 1744 KB Output is correct
16 Correct 34 ms 1744 KB Output is correct
17 Correct 21 ms 1744 KB Output is correct
18 Correct 27 ms 1744 KB Output is correct
19 Correct 29 ms 1744 KB Output is correct
20 Correct 30 ms 1744 KB Output is correct
21 Correct 81 ms 1744 KB Output is correct
22 Correct 71 ms 1744 KB Output is correct
23 Correct 48 ms 1744 KB Output is correct
24 Correct 172 ms 1744 KB Output is correct
25 Correct 171 ms 1744 KB Output is correct
26 Correct 96 ms 1744 KB Output is correct
27 Correct 91 ms 1744 KB Output is correct
28 Correct 97 ms 1744 KB Output is correct
29 Correct 90 ms 1744 KB Output is correct
30 Correct 92 ms 1784 KB Output is correct
31 Correct 94 ms 1820 KB Output is correct
32 Correct 93 ms 1820 KB Output is correct
33 Correct 96 ms 1820 KB Output is correct
34 Correct 93 ms 1944 KB Output is correct
35 Correct 104 ms 1944 KB Output is correct
36 Correct 103 ms 1944 KB Output is correct
37 Correct 194 ms 1944 KB Output is correct
38 Correct 185 ms 1944 KB Output is correct
39 Correct 247 ms 1944 KB Output is correct
40 Correct 314 ms 1944 KB Output is correct
41 Correct 281 ms 1944 KB Output is correct
42 Correct 246 ms 1944 KB Output is correct
43 Correct 254 ms 2128 KB Output is correct
44 Correct 286 ms 2128 KB Output is correct
45 Correct 249 ms 2128 KB Output is correct
46 Correct 246 ms 2128 KB Output is correct
47 Correct 258 ms 2128 KB Output is correct
48 Correct 266 ms 2220 KB Output is correct
49 Correct 283 ms 2220 KB Output is correct
50 Correct 269 ms 2220 KB Output is correct
51 Correct 76 ms 2220 KB Output is correct
52 Correct 304 ms 2220 KB Output is correct
53 Correct 319 ms 2220 KB Output is correct
54 Correct 389 ms 2228 KB Output is correct
55 Correct 408 ms 2252 KB Output is correct
56 Correct 293 ms 2252 KB Output is correct
57 Correct 397 ms 2364 KB Output is correct
58 Correct 395 ms 2364 KB Output is correct
59 Correct 451 ms 2364 KB Output is correct
60 Correct 113 ms 2364 KB Output is correct
61 Correct 381 ms 2376 KB Output is correct
62 Correct 316 ms 2376 KB Output is correct
63 Correct 349 ms 2376 KB Output is correct
64 Correct 328 ms 2376 KB Output is correct
65 Correct 328 ms 2376 KB Output is correct
66 Correct 425 ms 2376 KB Output is correct
67 Correct 422 ms 2376 KB Output is correct
68 Correct 138 ms 2376 KB Output is correct
69 Correct 604 ms 3000 KB Output is correct
70 Correct 568 ms 3000 KB Output is correct
71 Correct 564 ms 3000 KB Output is correct
72 Correct 563 ms 3000 KB Output is correct
73 Correct 542 ms 3000 KB Output is correct
74 Correct 597 ms 3044 KB Output is correct
75 Correct 555 ms 3076 KB Output is correct
76 Correct 587 ms 3084 KB Output is correct
77 Correct 581 ms 3220 KB Output is correct