답안 #58457 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58457	2018-07-17T23:13:16 Z	Benq	Bootfall (IZhO17_bootfall)	C++14	65 / 100	1000 ms	6516 KB

bootfall

#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; }

B ad(B b, int x) {
    B b2;
    F0R(i,MX) {
        b2[i] = b[i];
        if (i >= x) b2[i] = add(b2[i],b[i-x]);
    }
    return b2;
}

B del(B b2, int x) { // b[i]+b[i-x] = b2[i], b[i] = b2[i]-b[i-x]
    B b;
    F0R(i,MX) {
        b[i] = b2[i];
        if (i >= x) b[i] = sub(b[i],b[i-x]);
    }
    return b;
}

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];
        b = ad(b,a[i]);
    }
    if (sum % 2 != 0 || !b[sum/2]) {
        cout << 0;
        exit(0);
    }
    F0R(i,N) {
        auto x = del(b,a[i]);
        /*F0R(i,11) cout << x[i] << " ";
        cout << "\n";*/
        int sum2 = sum-a[i];
        bitset<MX> cur;
        F0R(j,MX) if (2*j < sum2 && x[j]) {
            cur[sum2-2*j] = 1;
        }
        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

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	5284 KB	Output is correct
2	Correct	18 ms	5348 KB	Output is correct
3	Correct	7 ms	5348 KB	Output is correct
4	Correct	14 ms	5372 KB	Output is correct
5	Correct	30 ms	5492 KB	Output is correct
6	Correct	22 ms	5492 KB	Output is correct
7	Correct	18 ms	5576 KB	Output is correct
8	Correct	36 ms	5576 KB	Output is correct
9	Correct	28 ms	5576 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	5284 KB	Output is correct
2	Correct	18 ms	5348 KB	Output is correct
3	Correct	7 ms	5348 KB	Output is correct
4	Correct	14 ms	5372 KB	Output is correct
5	Correct	30 ms	5492 KB	Output is correct
6	Correct	22 ms	5492 KB	Output is correct
7	Correct	18 ms	5576 KB	Output is correct
8	Correct	36 ms	5576 KB	Output is correct
9	Correct	28 ms	5576 KB	Output is correct
10	Correct	72 ms	5576 KB	Output is correct
11	Correct	70 ms	5612 KB	Output is correct
12	Correct	71 ms	5612 KB	Output is correct
13	Correct	61 ms	5612 KB	Output is correct
14	Correct	72 ms	5612 KB	Output is correct
15	Correct	75 ms	5612 KB	Output is correct
16	Correct	87 ms	5612 KB	Output is correct
17	Correct	73 ms	5612 KB	Output is correct
18	Correct	68 ms	5612 KB	Output is correct
19	Correct	80 ms	5612 KB	Output is correct
20	Correct	71 ms	5612 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	5284 KB	Output is correct
2	Correct	18 ms	5348 KB	Output is correct
3	Correct	7 ms	5348 KB	Output is correct
4	Correct	14 ms	5372 KB	Output is correct
5	Correct	30 ms	5492 KB	Output is correct
6	Correct	22 ms	5492 KB	Output is correct
7	Correct	18 ms	5576 KB	Output is correct
8	Correct	36 ms	5576 KB	Output is correct
9	Correct	28 ms	5576 KB	Output is correct
10	Correct	72 ms	5576 KB	Output is correct
11	Correct	70 ms	5612 KB	Output is correct
12	Correct	71 ms	5612 KB	Output is correct
13	Correct	61 ms	5612 KB	Output is correct
14	Correct	72 ms	5612 KB	Output is correct
15	Correct	75 ms	5612 KB	Output is correct
16	Correct	87 ms	5612 KB	Output is correct
17	Correct	73 ms	5612 KB	Output is correct
18	Correct	68 ms	5612 KB	Output is correct
19	Correct	80 ms	5612 KB	Output is correct
20	Correct	71 ms	5612 KB	Output is correct
21	Correct	151 ms	5612 KB	Output is correct
22	Correct	180 ms	5612 KB	Output is correct
23	Correct	128 ms	5612 KB	Output is correct
24	Correct	224 ms	5676 KB	Output is correct
25	Correct	221 ms	5676 KB	Output is correct
26	Correct	231 ms	5676 KB	Output is correct
27	Correct	278 ms	5708 KB	Output is correct
28	Correct	227 ms	5708 KB	Output is correct
29	Correct	234 ms	5708 KB	Output is correct
30	Correct	231 ms	5708 KB	Output is correct
31	Correct	245 ms	5708 KB	Output is correct
32	Correct	235 ms	5788 KB	Output is correct
33	Correct	259 ms	5788 KB	Output is correct
34	Correct	273 ms	5788 KB	Output is correct
35	Correct	227 ms	5788 KB	Output is correct
36	Correct	269 ms	5788 KB	Output is correct

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	5284 KB	Output is correct
2	Correct	18 ms	5348 KB	Output is correct
3	Correct	7 ms	5348 KB	Output is correct
4	Correct	14 ms	5372 KB	Output is correct
5	Correct	30 ms	5492 KB	Output is correct
6	Correct	22 ms	5492 KB	Output is correct
7	Correct	18 ms	5576 KB	Output is correct
8	Correct	36 ms	5576 KB	Output is correct
9	Correct	28 ms	5576 KB	Output is correct
10	Correct	72 ms	5576 KB	Output is correct
11	Correct	70 ms	5612 KB	Output is correct
12	Correct	71 ms	5612 KB	Output is correct
13	Correct	61 ms	5612 KB	Output is correct
14	Correct	72 ms	5612 KB	Output is correct
15	Correct	75 ms	5612 KB	Output is correct
16	Correct	87 ms	5612 KB	Output is correct
17	Correct	73 ms	5612 KB	Output is correct
18	Correct	68 ms	5612 KB	Output is correct
19	Correct	80 ms	5612 KB	Output is correct
20	Correct	71 ms	5612 KB	Output is correct
21	Correct	151 ms	5612 KB	Output is correct
22	Correct	180 ms	5612 KB	Output is correct
23	Correct	128 ms	5612 KB	Output is correct
24	Correct	224 ms	5676 KB	Output is correct
25	Correct	221 ms	5676 KB	Output is correct
26	Correct	231 ms	5676 KB	Output is correct
27	Correct	278 ms	5708 KB	Output is correct
28	Correct	227 ms	5708 KB	Output is correct
29	Correct	234 ms	5708 KB	Output is correct
30	Correct	231 ms	5708 KB	Output is correct
31	Correct	245 ms	5708 KB	Output is correct
32	Correct	235 ms	5788 KB	Output is correct
33	Correct	259 ms	5788 KB	Output is correct
34	Correct	273 ms	5788 KB	Output is correct
35	Correct	227 ms	5788 KB	Output is correct
36	Correct	269 ms	5788 KB	Output is correct
37	Correct	513 ms	5840 KB	Output is correct
38	Correct	477 ms	5932 KB	Output is correct
39	Correct	570 ms	5932 KB	Output is correct
40	Correct	638 ms	5972 KB	Output is correct
41	Correct	845 ms	5972 KB	Output is correct
42	Correct	578 ms	5972 KB	Output is correct
43	Correct	613 ms	6016 KB	Output is correct
44	Correct	756 ms	6308 KB	Output is correct
45	Correct	593 ms	6308 KB	Output is correct
46	Correct	653 ms	6308 KB	Output is correct
47	Correct	594 ms	6308 KB	Output is correct
48	Correct	595 ms	6308 KB	Output is correct
49	Correct	566 ms	6308 KB	Output is correct
50	Correct	602 ms	6308 KB	Output is correct
51	Correct	258 ms	6308 KB	Output is correct
52	Correct	627 ms	6308 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	5284 KB	Output is correct
2	Correct	18 ms	5348 KB	Output is correct
3	Correct	7 ms	5348 KB	Output is correct
4	Correct	14 ms	5372 KB	Output is correct
5	Correct	30 ms	5492 KB	Output is correct
6	Correct	22 ms	5492 KB	Output is correct
7	Correct	18 ms	5576 KB	Output is correct
8	Correct	36 ms	5576 KB	Output is correct
9	Correct	28 ms	5576 KB	Output is correct
10	Correct	72 ms	5576 KB	Output is correct
11	Correct	70 ms	5612 KB	Output is correct
12	Correct	71 ms	5612 KB	Output is correct
13	Correct	61 ms	5612 KB	Output is correct
14	Correct	72 ms	5612 KB	Output is correct
15	Correct	75 ms	5612 KB	Output is correct
16	Correct	87 ms	5612 KB	Output is correct
17	Correct	73 ms	5612 KB	Output is correct
18	Correct	68 ms	5612 KB	Output is correct
19	Correct	80 ms	5612 KB	Output is correct
20	Correct	71 ms	5612 KB	Output is correct
21	Correct	151 ms	5612 KB	Output is correct
22	Correct	180 ms	5612 KB	Output is correct
23	Correct	128 ms	5612 KB	Output is correct
24	Correct	224 ms	5676 KB	Output is correct
25	Correct	221 ms	5676 KB	Output is correct
26	Correct	231 ms	5676 KB	Output is correct
27	Correct	278 ms	5708 KB	Output is correct
28	Correct	227 ms	5708 KB	Output is correct
29	Correct	234 ms	5708 KB	Output is correct
30	Correct	231 ms	5708 KB	Output is correct
31	Correct	245 ms	5708 KB	Output is correct
32	Correct	235 ms	5788 KB	Output is correct
33	Correct	259 ms	5788 KB	Output is correct
34	Correct	273 ms	5788 KB	Output is correct
35	Correct	227 ms	5788 KB	Output is correct
36	Correct	269 ms	5788 KB	Output is correct
37	Correct	513 ms	5840 KB	Output is correct
38	Correct	477 ms	5932 KB	Output is correct
39	Correct	570 ms	5932 KB	Output is correct
40	Correct	638 ms	5972 KB	Output is correct
41	Correct	845 ms	5972 KB	Output is correct
42	Correct	578 ms	5972 KB	Output is correct
43	Correct	613 ms	6016 KB	Output is correct
44	Correct	756 ms	6308 KB	Output is correct
45	Correct	593 ms	6308 KB	Output is correct
46	Correct	653 ms	6308 KB	Output is correct
47	Correct	594 ms	6308 KB	Output is correct
48	Correct	595 ms	6308 KB	Output is correct
49	Correct	566 ms	6308 KB	Output is correct
50	Correct	602 ms	6308 KB	Output is correct
51	Correct	258 ms	6308 KB	Output is correct
52	Correct	627 ms	6308 KB	Output is correct
53	Correct	819 ms	6308 KB	Output is correct
54	Correct	900 ms	6308 KB	Output is correct
55	Correct	970 ms	6492 KB	Output is correct
56	Correct	833 ms	6492 KB	Output is correct
57	Correct	934 ms	6500 KB	Output is correct
58	Correct	946 ms	6500 KB	Output is correct
59	Correct	855 ms	6500 KB	Output is correct
60	Correct	425 ms	6500 KB	Output is correct
61	Correct	906 ms	6500 KB	Output is correct
62	Correct	805 ms	6500 KB	Output is correct
63	Correct	841 ms	6516 KB	Output is correct
64	Correct	804 ms	6516 KB	Output is correct
65	Correct	785 ms	6516 KB	Output is correct
66	Correct	739 ms	6516 KB	Output is correct

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	5284 KB	Output is correct
2	Correct	18 ms	5348 KB	Output is correct
3	Correct	7 ms	5348 KB	Output is correct
4	Correct	14 ms	5372 KB	Output is correct
5	Correct	30 ms	5492 KB	Output is correct
6	Correct	22 ms	5492 KB	Output is correct
7	Correct	18 ms	5576 KB	Output is correct
8	Correct	36 ms	5576 KB	Output is correct
9	Correct	28 ms	5576 KB	Output is correct
10	Correct	72 ms	5576 KB	Output is correct
11	Correct	70 ms	5612 KB	Output is correct
12	Correct	71 ms	5612 KB	Output is correct
13	Correct	61 ms	5612 KB	Output is correct
14	Correct	72 ms	5612 KB	Output is correct
15	Correct	75 ms	5612 KB	Output is correct
16	Correct	87 ms	5612 KB	Output is correct
17	Correct	73 ms	5612 KB	Output is correct
18	Correct	68 ms	5612 KB	Output is correct
19	Correct	80 ms	5612 KB	Output is correct
20	Correct	71 ms	5612 KB	Output is correct
21	Correct	151 ms	5612 KB	Output is correct
22	Correct	180 ms	5612 KB	Output is correct
23	Correct	128 ms	5612 KB	Output is correct
24	Correct	224 ms	5676 KB	Output is correct
25	Correct	221 ms	5676 KB	Output is correct
26	Correct	231 ms	5676 KB	Output is correct
27	Correct	278 ms	5708 KB	Output is correct
28	Correct	227 ms	5708 KB	Output is correct
29	Correct	234 ms	5708 KB	Output is correct
30	Correct	231 ms	5708 KB	Output is correct
31	Correct	245 ms	5708 KB	Output is correct
32	Correct	235 ms	5788 KB	Output is correct
33	Correct	259 ms	5788 KB	Output is correct
34	Correct	273 ms	5788 KB	Output is correct
35	Correct	227 ms	5788 KB	Output is correct
36	Correct	269 ms	5788 KB	Output is correct
37	Correct	513 ms	5840 KB	Output is correct
38	Correct	477 ms	5932 KB	Output is correct
39	Correct	570 ms	5932 KB	Output is correct
40	Correct	638 ms	5972 KB	Output is correct
41	Correct	845 ms	5972 KB	Output is correct
42	Correct	578 ms	5972 KB	Output is correct
43	Correct	613 ms	6016 KB	Output is correct
44	Correct	756 ms	6308 KB	Output is correct
45	Correct	593 ms	6308 KB	Output is correct
46	Correct	653 ms	6308 KB	Output is correct
47	Correct	594 ms	6308 KB	Output is correct
48	Correct	595 ms	6308 KB	Output is correct
49	Correct	566 ms	6308 KB	Output is correct
50	Correct	602 ms	6308 KB	Output is correct
51	Correct	258 ms	6308 KB	Output is correct
52	Correct	627 ms	6308 KB	Output is correct
53	Correct	819 ms	6308 KB	Output is correct
54	Correct	900 ms	6308 KB	Output is correct
55	Correct	970 ms	6492 KB	Output is correct
56	Correct	833 ms	6492 KB	Output is correct
57	Correct	934 ms	6500 KB	Output is correct
58	Correct	946 ms	6500 KB	Output is correct
59	Correct	855 ms	6500 KB	Output is correct
60	Correct	425 ms	6500 KB	Output is correct
61	Correct	906 ms	6500 KB	Output is correct
62	Correct	805 ms	6500 KB	Output is correct
63	Correct	841 ms	6516 KB	Output is correct
64	Correct	804 ms	6516 KB	Output is correct
65	Correct	785 ms	6516 KB	Output is correct
66	Correct	739 ms	6516 KB	Output is correct
67	Execution timed out	1020 ms	6516 KB	Time limit exceeded
68	Halted	0 ms	0 KB	-

답안 #58457

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.0 / 15.0

Subtask #4 16.0 / 16.0

Subtask #5 21.0 / 21.0

Subtask #6 0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
15.0 / 15.0

Subtask #4
16.0 / 16.0

Subtask #5
21.0 / 21.0

Subtask #6
0 / 35.0