oj.uz

Submission #522883

# Submission time Handle Problem Language Result Execution time Memory
522883 2022-02-06T09:40:08 Z Nursik Bootfall (IZhO17_bootfall) C++14
13 / 100
 78 ms 6220 KB 
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair

const ll maxn = 5e2 + 1, maxm = 4e3 + 1,  maxk = 61;
const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353;
const ll pa = 31, block = 400;

using namespace std;

ll n, x, y;
ll a[maxn], dp[maxn * maxn + 10], cnt[maxn * maxn + 10], cnt2[maxn * maxn + 10];
int main(){
  //  ios_base::sync_with_stdio(false);
   // cin.tie(0), cout.tie(0);
    cin >> n;
    dp[0] = 1;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
        for (int j = maxn * maxn; j >= 0; --j){
            if (dp[j] > 0){
                dp[j + a[i]] += dp[j];
            }
        }
        x += a[i];
    }
    if (x % 2 != 0 || (x % 2 == 0 && dp[x / 2] == 0)){
        cout << 0 << '\n';
        return 0;
    }
    for (int i = 1; i <= maxn * maxn; ++i){
        cnt[i] = 1;
    }
    for (int i = 1; i <= n; ++i){
        y = x - a[i];
        for (int j = 0; j <= maxn * maxn; ++j){
            if (j + a[i] <= maxn * maxn){
                dp[j + a[i]] -= dp[j];
           //     dp[j + a[i]] = max(0ll, dp[j + a[i]]);
            }
        }
        for (int j = 0; j <= maxn * maxn; ++j){
            if (dp[j] > 0){
                ll f = j, s = y - j;
                ll rz = abs(f - s);
                if (cnt[rz] == 1){
                    cnt2[rz] = 1;
                }
            }
        }
        for (int j = maxn * maxn; j >= 0; --j){
            if (j + a[i] <= maxn * maxn - 1){
                dp[j + a[i]] += dp[j];
            }
        }
        for (int j = 1; j <= maxn * maxn; ++j){
            cnt[j] = cnt2[j];
            cnt2[j] = 0;
        }
    }
    vector<int> v;
    for (int i = 1; i <= maxn * maxn; ++i){
        if (cnt[i] > 0){
            v.pb(i);
        }
    }
    cout << v.size() << '\n';
    for (auto it : v){
        cout << it << " ";
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6092 KB Output is correct
2 Correct 9 ms 6220 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 7 ms 6072 KB Output is correct
5 Correct 13 ms 6188 KB Output is correct
6 Correct 17 ms 6092 KB Output is correct
7 Correct 9 ms 6188 KB Output is correct
8 Correct 14 ms 6092 KB Output is correct
9 Correct 12 ms 6092 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6092 KB Output is correct
2 Correct 9 ms 6220 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 7 ms 6072 KB Output is correct
5 Correct 13 ms 6188 KB Output is correct
6 Correct 17 ms 6092 KB Output is correct
7 Correct 9 ms 6188 KB Output is correct
8 Correct 14 ms 6092 KB Output is correct
9 Correct 12 ms 6092 KB Output is correct
10 Correct 28 ms 6092 KB Output is correct
11 Correct 39 ms 6092 KB Output is correct
12 Correct 28 ms 6168 KB Output is correct
13 Correct 27 ms 6064 KB Output is correct
14 Correct 27 ms 6092 KB Output is correct
15 Correct 29 ms 6068 KB Output is correct
16 Correct 33 ms 6180 KB Output is correct
17 Correct 20 ms 6188 KB Output is correct
18 Correct 31 ms 6184 KB Output is correct
19 Correct 26 ms 6092 KB Output is correct
20 Correct 43 ms 6092 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6092 KB Output is correct
2 Correct 9 ms 6220 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 7 ms 6072 KB Output is correct
5 Correct 13 ms 6188 KB Output is correct
6 Correct 17 ms 6092 KB Output is correct
7 Correct 9 ms 6188 KB Output is correct
8 Correct 14 ms 6092 KB Output is correct
9 Correct 12 ms 6092 KB Output is correct
10 Correct 28 ms 6092 KB Output is correct
11 Correct 39 ms 6092 KB Output is correct
12 Correct 28 ms 6168 KB Output is correct
13 Correct 27 ms 6064 KB Output is correct
14 Correct 27 ms 6092 KB Output is correct
15 Correct 29 ms 6068 KB Output is correct
16 Correct 33 ms 6180 KB Output is correct
17 Correct 20 ms 6188 KB Output is correct
18 Correct 31 ms 6184 KB Output is correct
19 Correct 26 ms 6092 KB Output is correct
20 Correct 43 ms 6092 KB Output is correct
21 Correct 59 ms 6172 KB Output is correct
22 Incorrect 78 ms 6164 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6092 KB Output is correct
2 Correct 9 ms 6220 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 7 ms 6072 KB Output is correct
5 Correct 13 ms 6188 KB Output is correct
6 Correct 17 ms 6092 KB Output is correct
7 Correct 9 ms 6188 KB Output is correct
8 Correct 14 ms 6092 KB Output is correct
9 Correct 12 ms 6092 KB Output is correct
10 Correct 28 ms 6092 KB Output is correct
11 Correct 39 ms 6092 KB Output is correct
12 Correct 28 ms 6168 KB Output is correct
13 Correct 27 ms 6064 KB Output is correct
14 Correct 27 ms 6092 KB Output is correct
15 Correct 29 ms 6068 KB Output is correct
16 Correct 33 ms 6180 KB Output is correct
17 Correct 20 ms 6188 KB Output is correct
18 Correct 31 ms 6184 KB Output is correct
19 Correct 26 ms 6092 KB Output is correct
20 Correct 43 ms 6092 KB Output is correct
21 Correct 59 ms 6172 KB Output is correct
22 Incorrect 78 ms 6164 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6092 KB Output is correct
2 Correct 9 ms 6220 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 7 ms 6072 KB Output is correct
5 Correct 13 ms 6188 KB Output is correct
6 Correct 17 ms 6092 KB Output is correct
7 Correct 9 ms 6188 KB Output is correct
8 Correct 14 ms 6092 KB Output is correct
9 Correct 12 ms 6092 KB Output is correct
10 Correct 28 ms 6092 KB Output is correct
11 Correct 39 ms 6092 KB Output is correct
12 Correct 28 ms 6168 KB Output is correct
13 Correct 27 ms 6064 KB Output is correct
14 Correct 27 ms 6092 KB Output is correct
15 Correct 29 ms 6068 KB Output is correct
16 Correct 33 ms 6180 KB Output is correct
17 Correct 20 ms 6188 KB Output is correct
18 Correct 31 ms 6184 KB Output is correct
19 Correct 26 ms 6092 KB Output is correct
20 Correct 43 ms 6092 KB Output is correct
21 Correct 59 ms 6172 KB Output is correct
22 Incorrect 78 ms 6164 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6092 KB Output is correct
2 Correct 9 ms 6220 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 7 ms 6072 KB Output is correct
5 Correct 13 ms 6188 KB Output is correct
6 Correct 17 ms 6092 KB Output is correct
7 Correct 9 ms 6188 KB Output is correct
8 Correct 14 ms 6092 KB Output is correct
9 Correct 12 ms 6092 KB Output is correct
10 Correct 28 ms 6092 KB Output is correct
11 Correct 39 ms 6092 KB Output is correct
12 Correct 28 ms 6168 KB Output is correct
13 Correct 27 ms 6064 KB Output is correct
14 Correct 27 ms 6092 KB Output is correct
15 Correct 29 ms 6068 KB Output is correct
16 Correct 33 ms 6180 KB Output is correct
17 Correct 20 ms 6188 KB Output is correct
18 Correct 31 ms 6184 KB Output is correct
19 Correct 26 ms 6092 KB Output is correct
20 Correct 43 ms 6092 KB Output is correct
21 Correct 59 ms 6172 KB Output is correct
22 Incorrect 78 ms 6164 KB Output isn't correct
23 Halted 0 ms 0 KB -