oj.uz

Submission #522884

# Submission time Handle Problem Language Result Execution time Memory
522884 2022-02-06T09:41:36 Z Nursik Bootfall (IZhO17_bootfall) C++14
13 / 100
 449 ms 23856 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 = 1e3 + 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 36 ms 23796 KB Output is correct
2 Correct 43 ms 23740 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 38 ms 23756 KB Output is correct
5 Correct 72 ms 23800 KB Output is correct
6 Correct 50 ms 23756 KB Output is correct
7 Correct 43 ms 23808 KB Output is correct
8 Correct 76 ms 23856 KB Output is correct
9 Correct 69 ms 23720 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 23796 KB Output is correct
2 Correct 43 ms 23740 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 38 ms 23756 KB Output is correct
5 Correct 72 ms 23800 KB Output is correct
6 Correct 50 ms 23756 KB Output is correct
7 Correct 43 ms 23808 KB Output is correct
8 Correct 76 ms 23856 KB Output is correct
9 Correct 69 ms 23720 KB Output is correct
10 Correct 189 ms 23800 KB Output is correct
11 Correct 168 ms 23800 KB Output is correct
12 Correct 160 ms 23800 KB Output is correct
13 Correct 135 ms 23748 KB Output is correct
14 Correct 149 ms 23804 KB Output is correct
15 Correct 148 ms 23740 KB Output is correct
16 Correct 164 ms 23800 KB Output is correct
17 Correct 113 ms 23740 KB Output is correct
18 Correct 136 ms 23804 KB Output is correct
19 Correct 135 ms 23804 KB Output is correct
20 Correct 157 ms 23808 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 23796 KB Output is correct
2 Correct 43 ms 23740 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 38 ms 23756 KB Output is correct
5 Correct 72 ms 23800 KB Output is correct
6 Correct 50 ms 23756 KB Output is correct
7 Correct 43 ms 23808 KB Output is correct
8 Correct 76 ms 23856 KB Output is correct
9 Correct 69 ms 23720 KB Output is correct
10 Correct 189 ms 23800 KB Output is correct
11 Correct 168 ms 23800 KB Output is correct
12 Correct 160 ms 23800 KB Output is correct
13 Correct 135 ms 23748 KB Output is correct
14 Correct 149 ms 23804 KB Output is correct
15 Correct 148 ms 23740 KB Output is correct
16 Correct 164 ms 23800 KB Output is correct
17 Correct 113 ms 23740 KB Output is correct
18 Correct 136 ms 23804 KB Output is correct
19 Correct 135 ms 23804 KB Output is correct
20 Correct 157 ms 23808 KB Output is correct
21 Correct 347 ms 23744 KB Output is correct
22 Incorrect 449 ms 23808 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 23796 KB Output is correct
2 Correct 43 ms 23740 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 38 ms 23756 KB Output is correct
5 Correct 72 ms 23800 KB Output is correct
6 Correct 50 ms 23756 KB Output is correct
7 Correct 43 ms 23808 KB Output is correct
8 Correct 76 ms 23856 KB Output is correct
9 Correct 69 ms 23720 KB Output is correct
10 Correct 189 ms 23800 KB Output is correct
11 Correct 168 ms 23800 KB Output is correct
12 Correct 160 ms 23800 KB Output is correct
13 Correct 135 ms 23748 KB Output is correct
14 Correct 149 ms 23804 KB Output is correct
15 Correct 148 ms 23740 KB Output is correct
16 Correct 164 ms 23800 KB Output is correct
17 Correct 113 ms 23740 KB Output is correct
18 Correct 136 ms 23804 KB Output is correct
19 Correct 135 ms 23804 KB Output is correct
20 Correct 157 ms 23808 KB Output is correct
21 Correct 347 ms 23744 KB Output is correct
22 Incorrect 449 ms 23808 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 23796 KB Output is correct
2 Correct 43 ms 23740 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 38 ms 23756 KB Output is correct
5 Correct 72 ms 23800 KB Output is correct
6 Correct 50 ms 23756 KB Output is correct
7 Correct 43 ms 23808 KB Output is correct
8 Correct 76 ms 23856 KB Output is correct
9 Correct 69 ms 23720 KB Output is correct
10 Correct 189 ms 23800 KB Output is correct
11 Correct 168 ms 23800 KB Output is correct
12 Correct 160 ms 23800 KB Output is correct
13 Correct 135 ms 23748 KB Output is correct
14 Correct 149 ms 23804 KB Output is correct
15 Correct 148 ms 23740 KB Output is correct
16 Correct 164 ms 23800 KB Output is correct
17 Correct 113 ms 23740 KB Output is correct
18 Correct 136 ms 23804 KB Output is correct
19 Correct 135 ms 23804 KB Output is correct
20 Correct 157 ms 23808 KB Output is correct
21 Correct 347 ms 23744 KB Output is correct
22 Incorrect 449 ms 23808 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 23796 KB Output is correct
2 Correct 43 ms 23740 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 38 ms 23756 KB Output is correct
5 Correct 72 ms 23800 KB Output is correct
6 Correct 50 ms 23756 KB Output is correct
7 Correct 43 ms 23808 KB Output is correct
8 Correct 76 ms 23856 KB Output is correct
9 Correct 69 ms 23720 KB Output is correct
10 Correct 189 ms 23800 KB Output is correct
11 Correct 168 ms 23800 KB Output is correct
12 Correct 160 ms 23800 KB Output is correct
13 Correct 135 ms 23748 KB Output is correct
14 Correct 149 ms 23804 KB Output is correct
15 Correct 148 ms 23740 KB Output is correct
16 Correct 164 ms 23800 KB Output is correct
17 Correct 113 ms 23740 KB Output is correct
18 Correct 136 ms 23804 KB Output is correct
19 Correct 135 ms 23804 KB Output is correct
20 Correct 157 ms 23808 KB Output is correct
21 Correct 347 ms 23744 KB Output is correct
22 Incorrect 449 ms 23808 KB Output isn't correct
23 Halted 0 ms 0 KB -