oj.uz

Submission #58458

# Submission time Handle Problem Language Result Execution time Memory
58458 2018-07-17T23:16:05 Z Benq Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 3056 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 add(int a, int b) { return (a+b)%MOD; }

int sub(int a, int b) { return (a-b+MOD)%MOD; }

void ad(B& b, int x) {
    FORd(i,x,MX) b[i] = add(b[i],b[i-x]);
}

void del(B& b, int x) { // b[i]+b[i-x] = b2[i], b[i] = b2[i]-b[i-x]
    FOR(i,x,MX) b[i] = sub(b[i],b[i-x]);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    all.flip();
    cin >> N;
    b[0] = 1;
    int sum = 0;
    F0R(i,N) {
        cin >> a[i];
        sum += a[i];
        ad(b,a[i]);
    }
    if (sum % 2 != 0 || !b[sum/2]) {
        cout << 0;
        exit(0);
    }
    F0R(i,N) {
        del(b,a[i]);
        int sum2 = sum-a[i];
        bitset<MX> cur;
        for (int j = 0; 2*j < sum2; ++j) if (b[j]) cur[sum2-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 14 ms 1400 KB Output is correct
2 Correct 15 ms 1400 KB Output is correct
3 Correct 5 ms 1436 KB Output is correct
4 Correct 11 ms 1568 KB Output is correct
5 Correct 25 ms 1572 KB Output is correct
6 Correct 18 ms 1572 KB Output is correct
7 Correct 14 ms 1572 KB Output is correct
8 Correct 25 ms 1572 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1400 KB Output is correct
2 Correct 15 ms 1400 KB Output is correct
3 Correct 5 ms 1436 KB Output is correct
4 Correct 11 ms 1568 KB Output is correct
5 Correct 25 ms 1572 KB Output is correct
6 Correct 18 ms 1572 KB Output is correct
7 Correct 14 ms 1572 KB Output is correct
8 Correct 25 ms 1572 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct
10 Correct 65 ms 1656 KB Output is correct
11 Correct 65 ms 1656 KB Output is correct
12 Correct 55 ms 1656 KB Output is correct
13 Correct 62 ms 1656 KB Output is correct
14 Correct 53 ms 1656 KB Output is correct
15 Correct 61 ms 1656 KB Output is correct
16 Correct 89 ms 1744 KB Output is correct
17 Correct 38 ms 1744 KB Output is correct
18 Correct 44 ms 1744 KB Output is correct
19 Correct 53 ms 1744 KB Output is correct
20 Correct 53 ms 1744 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1400 KB Output is correct
2 Correct 15 ms 1400 KB Output is correct
3 Correct 5 ms 1436 KB Output is correct
4 Correct 11 ms 1568 KB Output is correct
5 Correct 25 ms 1572 KB Output is correct
6 Correct 18 ms 1572 KB Output is correct
7 Correct 14 ms 1572 KB Output is correct
8 Correct 25 ms 1572 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct
10 Correct 65 ms 1656 KB Output is correct
11 Correct 65 ms 1656 KB Output is correct
12 Correct 55 ms 1656 KB Output is correct
13 Correct 62 ms 1656 KB Output is correct
14 Correct 53 ms 1656 KB Output is correct
15 Correct 61 ms 1656 KB Output is correct
16 Correct 89 ms 1744 KB Output is correct
17 Correct 38 ms 1744 KB Output is correct
18 Correct 44 ms 1744 KB Output is correct
19 Correct 53 ms 1744 KB Output is correct
20 Correct 53 ms 1744 KB Output is correct
21 Correct 112 ms 1744 KB Output is correct
22 Correct 132 ms 1744 KB Output is correct
23 Correct 98 ms 1744 KB Output is correct
24 Correct 174 ms 1744 KB Output is correct
25 Correct 213 ms 1744 KB Output is correct
26 Correct 167 ms 1744 KB Output is correct
27 Correct 175 ms 1748 KB Output is correct
28 Correct 166 ms 1748 KB Output is correct
29 Correct 174 ms 1748 KB Output is correct
30 Correct 178 ms 1748 KB Output is correct
31 Correct 189 ms 1748 KB Output is correct
32 Correct 174 ms 1748 KB Output is correct
33 Correct 192 ms 1748 KB Output is correct
34 Correct 167 ms 1816 KB Output is correct
35 Correct 160 ms 1816 KB Output is correct
36 Correct 196 ms 1816 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1400 KB Output is correct
2 Correct 15 ms 1400 KB Output is correct
3 Correct 5 ms 1436 KB Output is correct
4 Correct 11 ms 1568 KB Output is correct
5 Correct 25 ms 1572 KB Output is correct
6 Correct 18 ms 1572 KB Output is correct
7 Correct 14 ms 1572 KB Output is correct
8 Correct 25 ms 1572 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct
10 Correct 65 ms 1656 KB Output is correct
11 Correct 65 ms 1656 KB Output is correct
12 Correct 55 ms 1656 KB Output is correct
13 Correct 62 ms 1656 KB Output is correct
14 Correct 53 ms 1656 KB Output is correct
15 Correct 61 ms 1656 KB Output is correct
16 Correct 89 ms 1744 KB Output is correct
17 Correct 38 ms 1744 KB Output is correct
18 Correct 44 ms 1744 KB Output is correct
19 Correct 53 ms 1744 KB Output is correct
20 Correct 53 ms 1744 KB Output is correct
21 Correct 112 ms 1744 KB Output is correct
22 Correct 132 ms 1744 KB Output is correct
23 Correct 98 ms 1744 KB Output is correct
24 Correct 174 ms 1744 KB Output is correct
25 Correct 213 ms 1744 KB Output is correct
26 Correct 167 ms 1744 KB Output is correct
27 Correct 175 ms 1748 KB Output is correct
28 Correct 166 ms 1748 KB Output is correct
29 Correct 174 ms 1748 KB Output is correct
30 Correct 178 ms 1748 KB Output is correct
31 Correct 189 ms 1748 KB Output is correct
32 Correct 174 ms 1748 KB Output is correct
33 Correct 192 ms 1748 KB Output is correct
34 Correct 167 ms 1816 KB Output is correct
35 Correct 160 ms 1816 KB Output is correct
36 Correct 196 ms 1816 KB Output is correct
37 Correct 386 ms 1832 KB Output is correct
38 Correct 358 ms 1936 KB Output is correct
39 Correct 500 ms 1936 KB Output is correct
40 Correct 445 ms 1936 KB Output is correct
41 Correct 452 ms 1936 KB Output is correct
42 Correct 455 ms 1936 KB Output is correct
43 Correct 501 ms 2216 KB Output is correct
44 Correct 404 ms 2216 KB Output is correct
45 Correct 393 ms 2216 KB Output is correct
46 Correct 409 ms 2216 KB Output is correct
47 Correct 437 ms 2216 KB Output is correct
48 Correct 480 ms 2216 KB Output is correct
49 Correct 477 ms 2216 KB Output is correct
50 Correct 448 ms 2216 KB Output is correct
51 Correct 134 ms 2216 KB Output is correct
52 Correct 445 ms 2216 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1400 KB Output is correct
2 Correct 15 ms 1400 KB Output is correct
3 Correct 5 ms 1436 KB Output is correct
4 Correct 11 ms 1568 KB Output is correct
5 Correct 25 ms 1572 KB Output is correct
6 Correct 18 ms 1572 KB Output is correct
7 Correct 14 ms 1572 KB Output is correct
8 Correct 25 ms 1572 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct
10 Correct 65 ms 1656 KB Output is correct
11 Correct 65 ms 1656 KB Output is correct
12 Correct 55 ms 1656 KB Output is correct
13 Correct 62 ms 1656 KB Output is correct
14 Correct 53 ms 1656 KB Output is correct
15 Correct 61 ms 1656 KB Output is correct
16 Correct 89 ms 1744 KB Output is correct
17 Correct 38 ms 1744 KB Output is correct
18 Correct 44 ms 1744 KB Output is correct
19 Correct 53 ms 1744 KB Output is correct
20 Correct 53 ms 1744 KB Output is correct
21 Correct 112 ms 1744 KB Output is correct
22 Correct 132 ms 1744 KB Output is correct
23 Correct 98 ms 1744 KB Output is correct
24 Correct 174 ms 1744 KB Output is correct
25 Correct 213 ms 1744 KB Output is correct
26 Correct 167 ms 1744 KB Output is correct
27 Correct 175 ms 1748 KB Output is correct
28 Correct 166 ms 1748 KB Output is correct
29 Correct 174 ms 1748 KB Output is correct
30 Correct 178 ms 1748 KB Output is correct
31 Correct 189 ms 1748 KB Output is correct
32 Correct 174 ms 1748 KB Output is correct
33 Correct 192 ms 1748 KB Output is correct
34 Correct 167 ms 1816 KB Output is correct
35 Correct 160 ms 1816 KB Output is correct
36 Correct 196 ms 1816 KB Output is correct
37 Correct 386 ms 1832 KB Output is correct
38 Correct 358 ms 1936 KB Output is correct
39 Correct 500 ms 1936 KB Output is correct
40 Correct 445 ms 1936 KB Output is correct
41 Correct 452 ms 1936 KB Output is correct
42 Correct 455 ms 1936 KB Output is correct
43 Correct 501 ms 2216 KB Output is correct
44 Correct 404 ms 2216 KB Output is correct
45 Correct 393 ms 2216 KB Output is correct
46 Correct 409 ms 2216 KB Output is correct
47 Correct 437 ms 2216 KB Output is correct
48 Correct 480 ms 2216 KB Output is correct
49 Correct 477 ms 2216 KB Output is correct
50 Correct 448 ms 2216 KB Output is correct
51 Correct 134 ms 2216 KB Output is correct
52 Correct 445 ms 2216 KB Output is correct
53 Correct 567 ms 2216 KB Output is correct
54 Correct 653 ms 2216 KB Output is correct
55 Correct 658 ms 2224 KB Output is correct
56 Correct 545 ms 2224 KB Output is correct
57 Correct 712 ms 2328 KB Output is correct
58 Correct 569 ms 2328 KB Output is correct
59 Correct 633 ms 2328 KB Output is correct
60 Correct 169 ms 2328 KB Output is correct
61 Correct 574 ms 2328 KB Output is correct
62 Correct 517 ms 2344 KB Output is correct
63 Correct 555 ms 2344 KB Output is correct
64 Correct 528 ms 2348 KB Output is correct
65 Correct 526 ms 2348 KB Output is correct
66 Correct 524 ms 2348 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1400 KB Output is correct
2 Correct 15 ms 1400 KB Output is correct
3 Correct 5 ms 1436 KB Output is correct
4 Correct 11 ms 1568 KB Output is correct
5 Correct 25 ms 1572 KB Output is correct
6 Correct 18 ms 1572 KB Output is correct
7 Correct 14 ms 1572 KB Output is correct
8 Correct 25 ms 1572 KB Output is correct
9 Correct 24 ms 1616 KB Output is correct
10 Correct 65 ms 1656 KB Output is correct
11 Correct 65 ms 1656 KB Output is correct
12 Correct 55 ms 1656 KB Output is correct
13 Correct 62 ms 1656 KB Output is correct
14 Correct 53 ms 1656 KB Output is correct
15 Correct 61 ms 1656 KB Output is correct
16 Correct 89 ms 1744 KB Output is correct
17 Correct 38 ms 1744 KB Output is correct
18 Correct 44 ms 1744 KB Output is correct
19 Correct 53 ms 1744 KB Output is correct
20 Correct 53 ms 1744 KB Output is correct
21 Correct 112 ms 1744 KB Output is correct
22 Correct 132 ms 1744 KB Output is correct
23 Correct 98 ms 1744 KB Output is correct
24 Correct 174 ms 1744 KB Output is correct
25 Correct 213 ms 1744 KB Output is correct
26 Correct 167 ms 1744 KB Output is correct
27 Correct 175 ms 1748 KB Output is correct
28 Correct 166 ms 1748 KB Output is correct
29 Correct 174 ms 1748 KB Output is correct
30 Correct 178 ms 1748 KB Output is correct
31 Correct 189 ms 1748 KB Output is correct
32 Correct 174 ms 1748 KB Output is correct
33 Correct 192 ms 1748 KB Output is correct
34 Correct 167 ms 1816 KB Output is correct
35 Correct 160 ms 1816 KB Output is correct
36 Correct 196 ms 1816 KB Output is correct
37 Correct 386 ms 1832 KB Output is correct
38 Correct 358 ms 1936 KB Output is correct
39 Correct 500 ms 1936 KB Output is correct
40 Correct 445 ms 1936 KB Output is correct
41 Correct 452 ms 1936 KB Output is correct
42 Correct 455 ms 1936 KB Output is correct
43 Correct 501 ms 2216 KB Output is correct
44 Correct 404 ms 2216 KB Output is correct
45 Correct 393 ms 2216 KB Output is correct
46 Correct 409 ms 2216 KB Output is correct
47 Correct 437 ms 2216 KB Output is correct
48 Correct 480 ms 2216 KB Output is correct
49 Correct 477 ms 2216 KB Output is correct
50 Correct 448 ms 2216 KB Output is correct
51 Correct 134 ms 2216 KB Output is correct
52 Correct 445 ms 2216 KB Output is correct
53 Correct 567 ms 2216 KB Output is correct
54 Correct 653 ms 2216 KB Output is correct
55 Correct 658 ms 2224 KB Output is correct
56 Correct 545 ms 2224 KB Output is correct
57 Correct 712 ms 2328 KB Output is correct
58 Correct 569 ms 2328 KB Output is correct
59 Correct 633 ms 2328 KB Output is correct
60 Correct 169 ms 2328 KB Output is correct
61 Correct 574 ms 2328 KB Output is correct
62 Correct 517 ms 2344 KB Output is correct
63 Correct 555 ms 2344 KB Output is correct
64 Correct 528 ms 2348 KB Output is correct
65 Correct 526 ms 2348 KB Output is correct
66 Correct 524 ms 2348 KB Output is correct
67 Correct 655 ms 2348 KB Output is correct
68 Correct 234 ms 2348 KB Output is correct
69 Correct 976 ms 3056 KB Output is correct
70 Execution timed out 1043 ms 3056 KB Time limit exceeded
71 Halted 0 ms 0 KB -