oj.uz

Submission #566242

# Submission time Handle Problem Language Result Execution time Memory
566242 2022-05-22T07:41:18 Z shrimb Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 4820 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;

char dp[maxn][maxn*maxn];
bitset<maxn*maxn> ans;
int n, tot, ex, total;
int a[maxn];

int rec (int i, int sm) {
    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;
    for (int J = 0 ; J < n ; J++) {
        for (int I = 0 ; I < total ; I++) {
            dp[J][I] = -1;
        }
    }
    if (!rec(0, total / 2)) {
        cout << 0 << endl;
        return 0;
    }
    ans[0] = 0;
    for (int i = 0 ; i < n ; i++) {
        tot = total - a[i];
        ex = i;
        for (int J = 0 ; J < n ; J++) {
            for (int I = 0 ; I < total ; I++) {
                dp[J][I] = -1;
            }
        }
        for (int j = 1 ; j <= total ; j++) {
            if ((tot+j)&1||!rec(0, (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 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 6 ms 476 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 ms 464 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 4 ms 468 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 6 ms 476 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 ms 464 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 92 ms 724 KB Output is correct
22 Correct 140 ms 868 KB Output is correct
23 Correct 45 ms 596 KB Output is correct
24 Correct 270 ms 1124 KB Output is correct
25 Correct 523 ms 1516 KB Output is correct
26 Correct 656 ms 1740 KB Output is correct
27 Correct 584 ms 1492 KB Output is correct
28 Correct 603 ms 1644 KB Output is correct
29 Correct 651 ms 1672 KB Output is correct
30 Correct 355 ms 1236 KB Output is correct
31 Correct 513 ms 1456 KB Output is correct
32 Correct 357 ms 1196 KB Output is correct
33 Correct 608 ms 1696 KB Output is correct
34 Correct 594 ms 1684 KB Output is correct
35 Correct 621 ms 1664 KB Output is correct
36 Correct 314 ms 1184 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 6 ms 476 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 ms 464 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 92 ms 724 KB Output is correct
22 Correct 140 ms 868 KB Output is correct
23 Correct 45 ms 596 KB Output is correct
24 Correct 270 ms 1124 KB Output is correct
25 Correct 523 ms 1516 KB Output is correct
26 Correct 656 ms 1740 KB Output is correct
27 Correct 584 ms 1492 KB Output is correct
28 Correct 603 ms 1644 KB Output is correct
29 Correct 651 ms 1672 KB Output is correct
30 Correct 355 ms 1236 KB Output is correct
31 Correct 513 ms 1456 KB Output is correct
32 Correct 357 ms 1196 KB Output is correct
33 Correct 608 ms 1696 KB Output is correct
34 Correct 594 ms 1684 KB Output is correct
35 Correct 621 ms 1664 KB Output is correct
36 Correct 314 ms 1184 KB Output is correct
37 Execution timed out 1093 ms 4820 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 6 ms 476 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 ms 464 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 92 ms 724 KB Output is correct
22 Correct 140 ms 868 KB Output is correct
23 Correct 45 ms 596 KB Output is correct
24 Correct 270 ms 1124 KB Output is correct
25 Correct 523 ms 1516 KB Output is correct
26 Correct 656 ms 1740 KB Output is correct
27 Correct 584 ms 1492 KB Output is correct
28 Correct 603 ms 1644 KB Output is correct
29 Correct 651 ms 1672 KB Output is correct
30 Correct 355 ms 1236 KB Output is correct
31 Correct 513 ms 1456 KB Output is correct
32 Correct 357 ms 1196 KB Output is correct
33 Correct 608 ms 1696 KB Output is correct
34 Correct 594 ms 1684 KB Output is correct
35 Correct 621 ms 1664 KB Output is correct
36 Correct 314 ms 1184 KB Output is correct
37 Execution timed out 1093 ms 4820 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 6 ms 476 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 ms 464 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 92 ms 724 KB Output is correct
22 Correct 140 ms 868 KB Output is correct
23 Correct 45 ms 596 KB Output is correct
24 Correct 270 ms 1124 KB Output is correct
25 Correct 523 ms 1516 KB Output is correct
26 Correct 656 ms 1740 KB Output is correct
27 Correct 584 ms 1492 KB Output is correct
28 Correct 603 ms 1644 KB Output is correct
29 Correct 651 ms 1672 KB Output is correct
30 Correct 355 ms 1236 KB Output is correct
31 Correct 513 ms 1456 KB Output is correct
32 Correct 357 ms 1196 KB Output is correct
33 Correct 608 ms 1696 KB Output is correct
34 Correct 594 ms 1684 KB Output is correct
35 Correct 621 ms 1664 KB Output is correct
36 Correct 314 ms 1184 KB Output is correct
37 Execution timed out 1093 ms 4820 KB Time limit exceeded
38 Halted 0 ms 0 KB -