oj.uz

Submission #982150

# Submission time Handle Problem Language Result Execution time Memory
982150 2024-05-14T01:09:30 Z LOLOLO Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 4120 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 500 + 30;
const int M = 500 * 500 + 10;
int f[M + 10], f2[M + 10], cnt[M + 10], mod = 1e8 + 3;
int a[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    f[0] = 1;

    ll sum = 0;
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum += a[i];
        for (int j = M; j >= a[i]; j--) {
            f[j] = (f[j] + f[j - a[i]]) % mod;
        }
    }

    if (sum % 2 == 0) {
        if (f[sum / 2] == 0) {
            cout << 0 << '\n';
            return 0;
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= M; j++) {
            if (j >= a[i]) {
                f2[j] = (f[j] - f2[j - a[i]]);
                while (f2[j] < 0)
                    f2[j] += mod;
            } else {
                f2[j] = f[j]; 
            }
        }

        int odd = (sum - a[i]) % 2;
        for (int j = odd; j <= M; j += 2) {
            int all = sum - a[i] + j;
            if (all % 2 == 0) {
                int h = all / 2;
                if (f2[h] || (h >= j && f2[h - j])) {
                    cnt[j]++;
                }
            }
        }
    }

    vector <int> save;
    for (int i = 1; i <= M; i++) 
        if (cnt[i] == n)
            save.pb(i);

    cout << sz(save) << '\n';
    for (auto x : save) 
        cout << x << " ";

    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3164 KB Output is correct
2 Correct 10 ms 3212 KB Output is correct
3 Correct 4 ms 3164 KB Output is correct
4 Correct 8 ms 3164 KB Output is correct
5 Correct 20 ms 3216 KB Output is correct
6 Correct 18 ms 3320 KB Output is correct
7 Correct 12 ms 3160 KB Output is correct
8 Correct 20 ms 3212 KB Output is correct
9 Correct 21 ms 3216 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3164 KB Output is correct
2 Correct 10 ms 3212 KB Output is correct
3 Correct 4 ms 3164 KB Output is correct
4 Correct 8 ms 3164 KB Output is correct
5 Correct 20 ms 3216 KB Output is correct
6 Correct 18 ms 3320 KB Output is correct
7 Correct 12 ms 3160 KB Output is correct
8 Correct 20 ms 3212 KB Output is correct
9 Correct 21 ms 3216 KB Output is correct
10 Correct 48 ms 3164 KB Output is correct
11 Correct 48 ms 3164 KB Output is correct
12 Correct 52 ms 3192 KB Output is correct
13 Correct 41 ms 3160 KB Output is correct
14 Correct 45 ms 3164 KB Output is correct
15 Correct 44 ms 3188 KB Output is correct
16 Correct 48 ms 3164 KB Output is correct
17 Correct 30 ms 3160 KB Output is correct
18 Correct 41 ms 3164 KB Output is correct
19 Correct 53 ms 3416 KB Output is correct
20 Correct 47 ms 3164 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3164 KB Output is correct
2 Correct 10 ms 3212 KB Output is correct
3 Correct 4 ms 3164 KB Output is correct
4 Correct 8 ms 3164 KB Output is correct
5 Correct 20 ms 3216 KB Output is correct
6 Correct 18 ms 3320 KB Output is correct
7 Correct 12 ms 3160 KB Output is correct
8 Correct 20 ms 3212 KB Output is correct
9 Correct 21 ms 3216 KB Output is correct
10 Correct 48 ms 3164 KB Output is correct
11 Correct 48 ms 3164 KB Output is correct
12 Correct 52 ms 3192 KB Output is correct
13 Correct 41 ms 3160 KB Output is correct
14 Correct 45 ms 3164 KB Output is correct
15 Correct 44 ms 3188 KB Output is correct
16 Correct 48 ms 3164 KB Output is correct
17 Correct 30 ms 3160 KB Output is correct
18 Correct 41 ms 3164 KB Output is correct
19 Correct 53 ms 3416 KB Output is correct
20 Correct 47 ms 3164 KB Output is correct
21 Correct 100 ms 3204 KB Output is correct
22 Correct 119 ms 3164 KB Output is correct
23 Correct 79 ms 3160 KB Output is correct
24 Correct 153 ms 3160 KB Output is correct
25 Correct 145 ms 3164 KB Output is correct
26 Correct 155 ms 3200 KB Output is correct
27 Correct 156 ms 3192 KB Output is correct
28 Correct 155 ms 3160 KB Output is correct
29 Correct 153 ms 3164 KB Output is correct
30 Correct 159 ms 3224 KB Output is correct
31 Correct 157 ms 3204 KB Output is correct
32 Correct 154 ms 3164 KB Output is correct
33 Correct 165 ms 3204 KB Output is correct
34 Correct 154 ms 3228 KB Output is correct
35 Correct 153 ms 3228 KB Output is correct
36 Correct 156 ms 3188 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3164 KB Output is correct
2 Correct 10 ms 3212 KB Output is correct
3 Correct 4 ms 3164 KB Output is correct
4 Correct 8 ms 3164 KB Output is correct
5 Correct 20 ms 3216 KB Output is correct
6 Correct 18 ms 3320 KB Output is correct
7 Correct 12 ms 3160 KB Output is correct
8 Correct 20 ms 3212 KB Output is correct
9 Correct 21 ms 3216 KB Output is correct
10 Correct 48 ms 3164 KB Output is correct
11 Correct 48 ms 3164 KB Output is correct
12 Correct 52 ms 3192 KB Output is correct
13 Correct 41 ms 3160 KB Output is correct
14 Correct 45 ms 3164 KB Output is correct
15 Correct 44 ms 3188 KB Output is correct
16 Correct 48 ms 3164 KB Output is correct
17 Correct 30 ms 3160 KB Output is correct
18 Correct 41 ms 3164 KB Output is correct
19 Correct 53 ms 3416 KB Output is correct
20 Correct 47 ms 3164 KB Output is correct
21 Correct 100 ms 3204 KB Output is correct
22 Correct 119 ms 3164 KB Output is correct
23 Correct 79 ms 3160 KB Output is correct
24 Correct 153 ms 3160 KB Output is correct
25 Correct 145 ms 3164 KB Output is correct
26 Correct 155 ms 3200 KB Output is correct
27 Correct 156 ms 3192 KB Output is correct
28 Correct 155 ms 3160 KB Output is correct
29 Correct 153 ms 3164 KB Output is correct
30 Correct 159 ms 3224 KB Output is correct
31 Correct 157 ms 3204 KB Output is correct
32 Correct 154 ms 3164 KB Output is correct
33 Correct 165 ms 3204 KB Output is correct
34 Correct 154 ms 3228 KB Output is correct
35 Correct 153 ms 3228 KB Output is correct
36 Correct 156 ms 3188 KB Output is correct
37 Correct 329 ms 3260 KB Output is correct
38 Correct 340 ms 3412 KB Output is correct
39 Correct 380 ms 3364 KB Output is correct
40 Correct 445 ms 3320 KB Output is correct
41 Correct 415 ms 3364 KB Output is correct
42 Correct 412 ms 3308 KB Output is correct
43 Correct 427 ms 3704 KB Output is correct
44 Correct 433 ms 3620 KB Output is correct
45 Correct 436 ms 3668 KB Output is correct
46 Correct 428 ms 3412 KB Output is correct
47 Correct 414 ms 3320 KB Output is correct
48 Correct 431 ms 3668 KB Output is correct
49 Correct 414 ms 3412 KB Output is correct
50 Correct 411 ms 3412 KB Output is correct
51 Correct 410 ms 3312 KB Output is correct
52 Correct 482 ms 3668 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3164 KB Output is correct
2 Correct 10 ms 3212 KB Output is correct
3 Correct 4 ms 3164 KB Output is correct
4 Correct 8 ms 3164 KB Output is correct
5 Correct 20 ms 3216 KB Output is correct
6 Correct 18 ms 3320 KB Output is correct
7 Correct 12 ms 3160 KB Output is correct
8 Correct 20 ms 3212 KB Output is correct
9 Correct 21 ms 3216 KB Output is correct
10 Correct 48 ms 3164 KB Output is correct
11 Correct 48 ms 3164 KB Output is correct
12 Correct 52 ms 3192 KB Output is correct
13 Correct 41 ms 3160 KB Output is correct
14 Correct 45 ms 3164 KB Output is correct
15 Correct 44 ms 3188 KB Output is correct
16 Correct 48 ms 3164 KB Output is correct
17 Correct 30 ms 3160 KB Output is correct
18 Correct 41 ms 3164 KB Output is correct
19 Correct 53 ms 3416 KB Output is correct
20 Correct 47 ms 3164 KB Output is correct
21 Correct 100 ms 3204 KB Output is correct
22 Correct 119 ms 3164 KB Output is correct
23 Correct 79 ms 3160 KB Output is correct
24 Correct 153 ms 3160 KB Output is correct
25 Correct 145 ms 3164 KB Output is correct
26 Correct 155 ms 3200 KB Output is correct
27 Correct 156 ms 3192 KB Output is correct
28 Correct 155 ms 3160 KB Output is correct
29 Correct 153 ms 3164 KB Output is correct
30 Correct 159 ms 3224 KB Output is correct
31 Correct 157 ms 3204 KB Output is correct
32 Correct 154 ms 3164 KB Output is correct
33 Correct 165 ms 3204 KB Output is correct
34 Correct 154 ms 3228 KB Output is correct
35 Correct 153 ms 3228 KB Output is correct
36 Correct 156 ms 3188 KB Output is correct
37 Correct 329 ms 3260 KB Output is correct
38 Correct 340 ms 3412 KB Output is correct
39 Correct 380 ms 3364 KB Output is correct
40 Correct 445 ms 3320 KB Output is correct
41 Correct 415 ms 3364 KB Output is correct
42 Correct 412 ms 3308 KB Output is correct
43 Correct 427 ms 3704 KB Output is correct
44 Correct 433 ms 3620 KB Output is correct
45 Correct 436 ms 3668 KB Output is correct
46 Correct 428 ms 3412 KB Output is correct
47 Correct 414 ms 3320 KB Output is correct
48 Correct 431 ms 3668 KB Output is correct
49 Correct 414 ms 3412 KB Output is correct
50 Correct 411 ms 3412 KB Output is correct
51 Correct 410 ms 3312 KB Output is correct
52 Correct 482 ms 3668 KB Output is correct
53 Correct 516 ms 3632 KB Output is correct
54 Correct 613 ms 3668 KB Output is correct
55 Correct 724 ms 3832 KB Output is correct
56 Correct 570 ms 3700 KB Output is correct
57 Correct 697 ms 4052 KB Output is correct
58 Correct 622 ms 3620 KB Output is correct
59 Correct 648 ms 3836 KB Output is correct
60 Correct 617 ms 3160 KB Output is correct
61 Correct 655 ms 4120 KB Output is correct
62 Correct 611 ms 3832 KB Output is correct
63 Correct 623 ms 3800 KB Output is correct
64 Correct 607 ms 3756 KB Output is correct
65 Correct 482 ms 3364 KB Output is correct
66 Correct 492 ms 3364 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3164 KB Output is correct
2 Correct 10 ms 3212 KB Output is correct
3 Correct 4 ms 3164 KB Output is correct
4 Correct 8 ms 3164 KB Output is correct
5 Correct 20 ms 3216 KB Output is correct
6 Correct 18 ms 3320 KB Output is correct
7 Correct 12 ms 3160 KB Output is correct
8 Correct 20 ms 3212 KB Output is correct
9 Correct 21 ms 3216 KB Output is correct
10 Correct 48 ms 3164 KB Output is correct
11 Correct 48 ms 3164 KB Output is correct
12 Correct 52 ms 3192 KB Output is correct
13 Correct 41 ms 3160 KB Output is correct
14 Correct 45 ms 3164 KB Output is correct
15 Correct 44 ms 3188 KB Output is correct
16 Correct 48 ms 3164 KB Output is correct
17 Correct 30 ms 3160 KB Output is correct
18 Correct 41 ms 3164 KB Output is correct
19 Correct 53 ms 3416 KB Output is correct
20 Correct 47 ms 3164 KB Output is correct
21 Correct 100 ms 3204 KB Output is correct
22 Correct 119 ms 3164 KB Output is correct
23 Correct 79 ms 3160 KB Output is correct
24 Correct 153 ms 3160 KB Output is correct
25 Correct 145 ms 3164 KB Output is correct
26 Correct 155 ms 3200 KB Output is correct
27 Correct 156 ms 3192 KB Output is correct
28 Correct 155 ms 3160 KB Output is correct
29 Correct 153 ms 3164 KB Output is correct
30 Correct 159 ms 3224 KB Output is correct
31 Correct 157 ms 3204 KB Output is correct
32 Correct 154 ms 3164 KB Output is correct
33 Correct 165 ms 3204 KB Output is correct
34 Correct 154 ms 3228 KB Output is correct
35 Correct 153 ms 3228 KB Output is correct
36 Correct 156 ms 3188 KB Output is correct
37 Correct 329 ms 3260 KB Output is correct
38 Correct 340 ms 3412 KB Output is correct
39 Correct 380 ms 3364 KB Output is correct
40 Correct 445 ms 3320 KB Output is correct
41 Correct 415 ms 3364 KB Output is correct
42 Correct 412 ms 3308 KB Output is correct
43 Correct 427 ms 3704 KB Output is correct
44 Correct 433 ms 3620 KB Output is correct
45 Correct 436 ms 3668 KB Output is correct
46 Correct 428 ms 3412 KB Output is correct
47 Correct 414 ms 3320 KB Output is correct
48 Correct 431 ms 3668 KB Output is correct
49 Correct 414 ms 3412 KB Output is correct
50 Correct 411 ms 3412 KB Output is correct
51 Correct 410 ms 3312 KB Output is correct
52 Correct 482 ms 3668 KB Output is correct
53 Correct 516 ms 3632 KB Output is correct
54 Correct 613 ms 3668 KB Output is correct
55 Correct 724 ms 3832 KB Output is correct
56 Correct 570 ms 3700 KB Output is correct
57 Correct 697 ms 4052 KB Output is correct
58 Correct 622 ms 3620 KB Output is correct
59 Correct 648 ms 3836 KB Output is correct
60 Correct 617 ms 3160 KB Output is correct
61 Correct 655 ms 4120 KB Output is correct
62 Correct 611 ms 3832 KB Output is correct
63 Correct 623 ms 3800 KB Output is correct
64 Correct 607 ms 3756 KB Output is correct
65 Correct 482 ms 3364 KB Output is correct
66 Correct 492 ms 3364 KB Output is correct
67 Correct 742 ms 3844 KB Output is correct
68 Correct 536 ms 3188 KB Output is correct
69 Execution timed out 1029 ms 3188 KB Time limit exceeded
70 Halted 0 ms 0 KB -