oj.uz

Submission #522880

# Submission time Handle Problem Language Result Execution time Memory
522880 2022-02-06T09:29:24 Z Nursik Bootfall (IZhO17_bootfall) C++14
13 / 100
 4 ms 360 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;

int n, x, y;
int a[maxn], dp[maxn * maxn], cnt[maxn * maxn], cnt2[maxn * maxn];
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];
        x += a[i];
        for (int j = x; j >= 0; --j){
            if (dp[j] > 0 && j + a[i] <= x){
                dp[j + a[i]] += dp[j];
            }
        }
    }
    if (x % 2 != 0 || (x % 2 == 0 && dp[x / 2] == 0)){
        cout << 0 << '\n';
        return 0;
    }
    for (int i = 1; i <= x; ++i){
        cnt[i] = 1;
    }
    for (int i = 1; i <= n; ++i){
        y = x - a[i];
        for (int j = 0; j <= x; ++j){
            if (j + a[i] <= x){
                dp[j + a[i]] -= dp[j];
            }
        }
        for (int j = 0; j <= x; ++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 = x; j >= 0; --j){
            if (j + a[i] <= x){
                dp[j + a[i]] += dp[j];
            }
        }
        for (int j = 1; j <= x; ++j){
            cnt[j] = cnt2[j];
            cnt2[j] = 0;
        }
    }
    vector<int> v;
    for (int i = 1; i <= maxn * maxn - 1; ++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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Incorrect 4 ms 360 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Incorrect 4 ms 360 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Incorrect 4 ms 360 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 320 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Incorrect 4 ms 360 KB Output isn't correct
22 Halted 0 ms 0 KB -