oj.uz

Submission #566250

# Submission time Handle Problem Language Result Execution time Memory
566250 2022-05-22T07:55:11 Z shrimb Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 468 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")

#include"bits/stdc++.h"
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;

// #define int long long
#define endl '\n'
#define mod 1000000007
//\
#define mod 1686876991

const int maxn = 271;

bool dp0[maxn*maxn], dp1[maxn*maxn];
bitset<maxn*maxn> ans;
int n, tot, ex=-1, total;
int a[maxn];

void rec () {
    for (int i = n ; i >= 0 ; i--) {
        for (int j = 0 ; j <= total ; j++) {
            if (i == n) dp0[j] = j == 0;
            else if (i == ex) dp0[j] = dp1[j];
            else dp0[j] = dp1[j] || (j - a[i] < 0 ? 0 : dp1[j - a[i]]);
        }
        swap(dp0, dp1);
    }
    swap(dp0, dp1);

    // if (sm < 0) return 0;
    // if (i == n) return sm == 0;
    // if (i == ex) return rec(i + 1, sm);
    // if (dp[i][sm] != -1) return dp[i][sm];
    // return dp[i][sm] = rec(i + 1, sm) | rec(i + 1, sm - a[i]);
}

signed main () {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    for (int i = 0 ; i < n ; i++) cin >> a[i], total += a[i];
    for (int i = 0 ; i <= total ; i++) ans[i] = 1;
    rec();
    if (!dp0[total/2]) {
        cout << 0 << endl;
        return 0;
    }
    // cerr << "here\n";
    ans[0] = 0;
    for (int i = 0 ; i < n ; i++) {
        tot = total - a[i];
        ex = i;
        rec();
        for (int j = 1 ; j <= total ; j++) {
            if ((tot+j)&1||!dp0[(tot+j)/2]) {
                ans[j] = 0;
            }
        }
    }
    cout << ans.count() << endl;
    for (int i = 0 ; i <= total ; i++) if (ans[i]) cout << i << " ";
}

Compilation message

bootfall.cpp:17:1: warning: multi-line comment [-Wcomment]
   17 | //\
      | ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 20 ms 460 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 64 ms 448 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 20 ms 468 KB Output is correct
8 Correct 64 ms 340 KB Output is correct
9 Correct 51 ms 448 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 20 ms 460 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 64 ms 448 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 20 ms 468 KB Output is correct
8 Correct 64 ms 340 KB Output is correct
9 Correct 51 ms 448 KB Output is correct
10 Correct 358 ms 448 KB Output is correct
11 Correct 344 ms 448 KB Output is correct
12 Correct 347 ms 444 KB Output is correct
13 Correct 266 ms 340 KB Output is correct
14 Correct 307 ms 468 KB Output is correct
15 Correct 308 ms 444 KB Output is correct
16 Correct 342 ms 444 KB Output is correct
17 Correct 138 ms 444 KB Output is correct
18 Correct 227 ms 448 KB Output is correct
19 Correct 258 ms 340 KB Output is correct
20 Correct 342 ms 448 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 20 ms 460 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 64 ms 448 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 20 ms 468 KB Output is correct
8 Correct 64 ms 340 KB Output is correct
9 Correct 51 ms 448 KB Output is correct
10 Correct 358 ms 448 KB Output is correct
11 Correct 344 ms 448 KB Output is correct
12 Correct 347 ms 444 KB Output is correct
13 Correct 266 ms 340 KB Output is correct
14 Correct 307 ms 468 KB Output is correct
15 Correct 308 ms 444 KB Output is correct
16 Correct 342 ms 444 KB Output is correct
17 Correct 138 ms 444 KB Output is correct
18 Correct 227 ms 448 KB Output is correct
19 Correct 258 ms 340 KB Output is correct
20 Correct 342 ms 448 KB Output is correct
21 Execution timed out 1079 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 20 ms 460 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 64 ms 448 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 20 ms 468 KB Output is correct
8 Correct 64 ms 340 KB Output is correct
9 Correct 51 ms 448 KB Output is correct
10 Correct 358 ms 448 KB Output is correct
11 Correct 344 ms 448 KB Output is correct
12 Correct 347 ms 444 KB Output is correct
13 Correct 266 ms 340 KB Output is correct
14 Correct 307 ms 468 KB Output is correct
15 Correct 308 ms 444 KB Output is correct
16 Correct 342 ms 444 KB Output is correct
17 Correct 138 ms 444 KB Output is correct
18 Correct 227 ms 448 KB Output is correct
19 Correct 258 ms 340 KB Output is correct
20 Correct 342 ms 448 KB Output is correct
21 Execution timed out 1079 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 20 ms 460 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 64 ms 448 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 20 ms 468 KB Output is correct
8 Correct 64 ms 340 KB Output is correct
9 Correct 51 ms 448 KB Output is correct
10 Correct 358 ms 448 KB Output is correct
11 Correct 344 ms 448 KB Output is correct
12 Correct 347 ms 444 KB Output is correct
13 Correct 266 ms 340 KB Output is correct
14 Correct 307 ms 468 KB Output is correct
15 Correct 308 ms 444 KB Output is correct
16 Correct 342 ms 444 KB Output is correct
17 Correct 138 ms 444 KB Output is correct
18 Correct 227 ms 448 KB Output is correct
19 Correct 258 ms 340 KB Output is correct
20 Correct 342 ms 448 KB Output is correct
21 Execution timed out 1079 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 20 ms 460 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 64 ms 448 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 20 ms 468 KB Output is correct
8 Correct 64 ms 340 KB Output is correct
9 Correct 51 ms 448 KB Output is correct
10 Correct 358 ms 448 KB Output is correct
11 Correct 344 ms 448 KB Output is correct
12 Correct 347 ms 444 KB Output is correct
13 Correct 266 ms 340 KB Output is correct
14 Correct 307 ms 468 KB Output is correct
15 Correct 308 ms 444 KB Output is correct
16 Correct 342 ms 444 KB Output is correct
17 Correct 138 ms 444 KB Output is correct
18 Correct 227 ms 448 KB Output is correct
19 Correct 258 ms 340 KB Output is correct
20 Correct 342 ms 448 KB Output is correct
21 Execution timed out 1079 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -