oj.uz

Submission #1022427

# Submission time Handle Problem Language Result Execution time Memory
1022427 2024-07-13T13:29:27 Z phoenix Bootfall (IZhO17_bootfall) C++17
100 / 100
 268 ms 3536 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int MOD1 = 1e9 + 7;
const int MOD2 = 1e9 + 9;
const int MOD3 = 998244353;
const int MOD4 = 999990011;
const int MOD5 = 999994081;
 
template<unsigned int MOD> 
struct mint {
    unsigned int v;
    mint() {}
    mint(long long val) : v(val - (val >= MOD) * MOD + (val < 0) * MOD) {}
    mint<MOD>& operator += (mint<MOD> other) {
        *this = mint(v + other.v);
        return *this;
    }
    mint<MOD>& operator -= (mint<MOD> other) {
        *this = mint(v - other.v);
        return *this;
    }
};
const int N = 550;
const int A = 250250;
 
int lim = 0;
mint<MOD1> dp1[A]{1};
mint<MOD2> dp2[A]{1};
mint<MOD3> dp3[A]{1};
mint<MOD4> dp4[A]{1};
mint<MOD5> dp5[A]{1};

unsigned int dp[A]{1};

int sum = 0;
 
void add(int val) {
    sum += val;
    for (int i = lim; i >= val; i--) {
        dp[i] += dp[i - val];
        // dp1[i] += dp1[i - val];
        // dp2[i] += dp2[i - val];
        // dp3[i] += dp3[i - val];
        // dp4[i] += dp4[i - val];
        // dp5[i] += dp5[i - val];
    }   
}
 
bool check(int sum) {
    if (sum < 0 && sum > lim) return 0;
    return (dp[sum]);
    // bool flag = true;
    // flag &= (dp1[sum].v > 0);
    // flag &= (dp2[sum].v > 0);
    // flag &= (dp3[sum].v > 0);
    // flag &= (dp4[sum].v > 0);
    // flag &= (dp5[sum].v > 0);
    // return flag;
}
 
void del(int val) {
    sum -= val;
    for (int i = val; i <= lim; i++) {
        dp[i] -= dp[i - val];
        // dp1[i] -= dp1[i - val];
        // dp2[i] -= dp2[i - val];
        // dp3[i] -= dp3[i - val];
        // dp4[i] -= dp4[i - val];
        // dp5[i] -= dp5[i - val];
    }
}
 
int n;
int a[N];
 
int cnt[A];
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        lim += a[i];
    }
    for (int i = 0; i < n; i++) {
        add(a[i]);
    }
    if (sum & 1 || !check(sum / 2)) {
        cout << 0;
        return 0;
    }
 
    for (int i = 0; i < n; i++) {
        if (i) add(a[i - 1]);
        del(a[i]);
        for (int s = 0; s <= lim; s++) {
            if (check(s)) {
                cnt[abs(2 * s - sum)]++;
            }
        }
    }
    vector<int> res;
    for (int i = 1; i <= lim; i++) {
        if (cnt[i] == 2 * n) 
            res.push_back(i);
    }
    cout << (int)res.size() << '\n';
    for (int c : res) cout << c << ' ';
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 496 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 508 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 528 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 344 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 496 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 508 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 528 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 344 KB Output is correct
37 Correct 9 ms 756 KB Output is correct
38 Correct 9 ms 660 KB Output is correct
39 Correct 30 ms 856 KB Output is correct
40 Correct 21 ms 740 KB Output is correct
41 Correct 37 ms 860 KB Output is correct
42 Correct 30 ms 856 KB Output is correct
43 Correct 30 ms 1104 KB Output is correct
44 Correct 55 ms 1104 KB Output is correct
45 Correct 32 ms 1108 KB Output is correct
46 Correct 23 ms 496 KB Output is correct
47 Correct 18 ms 856 KB Output is correct
48 Correct 33 ms 1108 KB Output is correct
49 Correct 31 ms 856 KB Output is correct
50 Correct 30 ms 856 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 46 ms 1280 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 496 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 508 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 528 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 344 KB Output is correct
37 Correct 9 ms 756 KB Output is correct
38 Correct 9 ms 660 KB Output is correct
39 Correct 30 ms 856 KB Output is correct
40 Correct 21 ms 740 KB Output is correct
41 Correct 37 ms 860 KB Output is correct
42 Correct 30 ms 856 KB Output is correct
43 Correct 30 ms 1104 KB Output is correct
44 Correct 55 ms 1104 KB Output is correct
45 Correct 32 ms 1108 KB Output is correct
46 Correct 23 ms 496 KB Output is correct
47 Correct 18 ms 856 KB Output is correct
48 Correct 33 ms 1108 KB Output is correct
49 Correct 31 ms 856 KB Output is correct
50 Correct 30 ms 856 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 46 ms 1280 KB Output is correct
53 Correct 30 ms 1108 KB Output is correct
54 Correct 47 ms 1108 KB Output is correct
55 Correct 82 ms 1752 KB Output is correct
56 Correct 42 ms 1116 KB Output is correct
57 Correct 90 ms 2004 KB Output is correct
58 Correct 47 ms 1216 KB Output is correct
59 Correct 66 ms 1456 KB Output is correct
60 Correct 16 ms 604 KB Output is correct
61 Correct 68 ms 1556 KB Output is correct
62 Correct 76 ms 1768 KB Output is correct
63 Correct 75 ms 1752 KB Output is correct
64 Correct 69 ms 1748 KB Output is correct
65 Correct 30 ms 868 KB Output is correct
66 Correct 33 ms 904 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 496 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 508 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 528 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 344 KB Output is correct
37 Correct 9 ms 756 KB Output is correct
38 Correct 9 ms 660 KB Output is correct
39 Correct 30 ms 856 KB Output is correct
40 Correct 21 ms 740 KB Output is correct
41 Correct 37 ms 860 KB Output is correct
42 Correct 30 ms 856 KB Output is correct
43 Correct 30 ms 1104 KB Output is correct
44 Correct 55 ms 1104 KB Output is correct
45 Correct 32 ms 1108 KB Output is correct
46 Correct 23 ms 496 KB Output is correct
47 Correct 18 ms 856 KB Output is correct
48 Correct 33 ms 1108 KB Output is correct
49 Correct 31 ms 856 KB Output is correct
50 Correct 30 ms 856 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 46 ms 1280 KB Output is correct
53 Correct 30 ms 1108 KB Output is correct
54 Correct 47 ms 1108 KB Output is correct
55 Correct 82 ms 1752 KB Output is correct
56 Correct 42 ms 1116 KB Output is correct
57 Correct 90 ms 2004 KB Output is correct
58 Correct 47 ms 1216 KB Output is correct
59 Correct 66 ms 1456 KB Output is correct
60 Correct 16 ms 604 KB Output is correct
61 Correct 68 ms 1556 KB Output is correct
62 Correct 76 ms 1768 KB Output is correct
63 Correct 75 ms 1752 KB Output is correct
64 Correct 69 ms 1748 KB Output is correct
65 Correct 30 ms 868 KB Output is correct
66 Correct 33 ms 904 KB Output is correct
67 Correct 91 ms 1444 KB Output is correct
68 Correct 25 ms 860 KB Output is correct
69 Correct 232 ms 3236 KB Output is correct
70 Correct 147 ms 2120 KB Output is correct
71 Correct 130 ms 2116 KB Output is correct
72 Correct 161 ms 1372 KB Output is correct
73 Correct 146 ms 1456 KB Output is correct
74 Correct 232 ms 3280 KB Output is correct
75 Correct 188 ms 2772 KB Output is correct
76 Correct 258 ms 3364 KB Output is correct
77 Correct 268 ms 3536 KB Output is correct