oj.uz

답안 #566245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566245 2022-05-22T07:49:49 Z shrimb Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 4948 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 dp[maxn][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) dp[i][j] = j == 0;
            else if (i == ex) dp[i][j] = dp[i + 1][j];
            else dp[i][j] = dp[i + 1][j] || (j - a[i] < 0 ? 0 : dp[i + 1][j - a[i]]);
        }
    }
    // 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 (!dp[0][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||!dp[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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 26 ms 800 KB Output is correct
22 Correct 34 ms 888 KB Output is correct
23 Correct 10 ms 668 KB Output is correct
24 Correct 71 ms 1132 KB Output is correct
25 Correct 144 ms 1532 KB Output is correct
26 Correct 172 ms 1660 KB Output is correct
27 Correct 156 ms 1620 KB Output is correct
28 Correct 173 ms 1620 KB Output is correct
29 Correct 188 ms 1688 KB Output is correct
30 Correct 86 ms 1244 KB Output is correct
31 Correct 125 ms 1468 KB Output is correct
32 Correct 86 ms 1200 KB Output is correct
33 Correct 183 ms 1620 KB Output is correct
34 Correct 181 ms 1700 KB Output is correct
35 Correct 175 ms 1688 KB Output is correct
36 Correct 75 ms 1196 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 26 ms 800 KB Output is correct
22 Correct 34 ms 888 KB Output is correct
23 Correct 10 ms 668 KB Output is correct
24 Correct 71 ms 1132 KB Output is correct
25 Correct 144 ms 1532 KB Output is correct
26 Correct 172 ms 1660 KB Output is correct
27 Correct 156 ms 1620 KB Output is correct
28 Correct 173 ms 1620 KB Output is correct
29 Correct 188 ms 1688 KB Output is correct
30 Correct 86 ms 1244 KB Output is correct
31 Correct 125 ms 1468 KB Output is correct
32 Correct 86 ms 1200 KB Output is correct
33 Correct 183 ms 1620 KB Output is correct
34 Correct 181 ms 1700 KB Output is correct
35 Correct 175 ms 1688 KB Output is correct
36 Correct 75 ms 1196 KB Output is correct
37 Execution timed out 1087 ms 4948 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 26 ms 800 KB Output is correct
22 Correct 34 ms 888 KB Output is correct
23 Correct 10 ms 668 KB Output is correct
24 Correct 71 ms 1132 KB Output is correct
25 Correct 144 ms 1532 KB Output is correct
26 Correct 172 ms 1660 KB Output is correct
27 Correct 156 ms 1620 KB Output is correct
28 Correct 173 ms 1620 KB Output is correct
29 Correct 188 ms 1688 KB Output is correct
30 Correct 86 ms 1244 KB Output is correct
31 Correct 125 ms 1468 KB Output is correct
32 Correct 86 ms 1200 KB Output is correct
33 Correct 183 ms 1620 KB Output is correct
34 Correct 181 ms 1700 KB Output is correct
35 Correct 175 ms 1688 KB Output is correct
36 Correct 75 ms 1196 KB Output is correct
37 Execution timed out 1087 ms 4948 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 26 ms 800 KB Output is correct
22 Correct 34 ms 888 KB Output is correct
23 Correct 10 ms 668 KB Output is correct
24 Correct 71 ms 1132 KB Output is correct
25 Correct 144 ms 1532 KB Output is correct
26 Correct 172 ms 1660 KB Output is correct
27 Correct 156 ms 1620 KB Output is correct
28 Correct 173 ms 1620 KB Output is correct
29 Correct 188 ms 1688 KB Output is correct
30 Correct 86 ms 1244 KB Output is correct
31 Correct 125 ms 1468 KB Output is correct
32 Correct 86 ms 1200 KB Output is correct
33 Correct 183 ms 1620 KB Output is correct
34 Correct 181 ms 1700 KB Output is correct
35 Correct 175 ms 1688 KB Output is correct
36 Correct 75 ms 1196 KB Output is correct
37 Execution timed out 1087 ms 4948 KB Time limit exceeded
38 Halted 0 ms 0 KB -