oj.uz

답안 #173462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173462 2020-01-04T08:11:54 Z srvlt Bootfall (IZhO17_bootfall) C++14
13 / 100
 1000 ms 2296 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree <pair <int, int>, null_type, less <pair <int, int> >, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;

#define ll long long
#define db double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define size(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define low_b lower_bound

#define endl "\n"
//#define int long long

using namespace std;

void dout() {
    cerr << endl;
}
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;

const int N = 273, M = 73000;
int n, a[N], total;
bitset <M> p[N], s[N], res, ans, tmp;

void dbg(bitset <M> & b) {
    for (int i = 0; i < M; i++) {
        cout << b[i];
    }
    cout << endl;
}

void solve(int tc) {
    // check for (int i = 0; i < n; j++)
    cin >> n;
    p[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        total += a[i];
        p[i] = p[i - 1];
        p[i] |= (p[i] << a[i]);
    }
    if ((total & 1) || !p[n][total >> 1]) {
        cout << 0;
        return;
    }
    s[n + 1][0] = 1;
    for (int i = n; i >= 1; i--) {
        s[i] = s[i + 1];
        s[i] |= (s[i] << a[i]);
    }
    int w;
    ans.set();
    for (int i = 1; i <= n; i++) {
        tmp = s[i + 1];
        for (int j = 1; j < M; j++) {
            if (p[i - 1][j]) {
                tmp |= (s[i + 1] << j);
            }
        }
        res.reset();
        w = total - a[i];
        for (int j = (w & 1); j <= w; j += 2) {
            if (tmp[w + j >> 1] || tmp[w - j >> 1]) {
                res[j] = 1;
            }
        }
        ans &= res;
    }
    cout << ans.count() << endl;
    for (int i = 0; i < M; i++) {
        if (ans[i]) {
            cout << i << " ";
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Compilation message

bootfall.cpp: In function 'void solve(int)':
bootfall.cpp:80:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
             if (tmp[w + j >> 1] || tmp[w - j >> 1]) {
                     ~~^~~
bootfall.cpp:80:42: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
             if (tmp[w + j >> 1] || tmp[w - j >> 1]) {
                                        ~~^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 6 ms 632 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 6 ms 632 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 15 ms 888 KB Output is correct
13 Correct 15 ms 888 KB Output is correct
14 Correct 18 ms 888 KB Output is correct
15 Correct 14 ms 888 KB Output is correct
16 Correct 16 ms 888 KB Output is correct
17 Correct 9 ms 760 KB Output is correct
18 Correct 13 ms 988 KB Output is correct
19 Correct 13 ms 892 KB Output is correct
20 Correct 8 ms 888 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 6 ms 632 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 15 ms 888 KB Output is correct
13 Correct 15 ms 888 KB Output is correct
14 Correct 18 ms 888 KB Output is correct
15 Correct 14 ms 888 KB Output is correct
16 Correct 16 ms 888 KB Output is correct
17 Correct 9 ms 760 KB Output is correct
18 Correct 13 ms 988 KB Output is correct
19 Correct 13 ms 892 KB Output is correct
20 Correct 8 ms 888 KB Output is correct
21 Correct 315 ms 1656 KB Output is correct
22 Correct 420 ms 1800 KB Output is correct
23 Correct 183 ms 1272 KB Output is correct
24 Correct 658 ms 2168 KB Output is correct
25 Correct 720 ms 2168 KB Output is correct
26 Correct 863 ms 2296 KB Output is correct
27 Correct 572 ms 2168 KB Output is correct
28 Correct 451 ms 2168 KB Output is correct
29 Correct 480 ms 2296 KB Output is correct
30 Correct 801 ms 2296 KB Output is correct
31 Execution timed out 1037 ms 2168 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 6 ms 632 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 15 ms 888 KB Output is correct
13 Correct 15 ms 888 KB Output is correct
14 Correct 18 ms 888 KB Output is correct
15 Correct 14 ms 888 KB Output is correct
16 Correct 16 ms 888 KB Output is correct
17 Correct 9 ms 760 KB Output is correct
18 Correct 13 ms 988 KB Output is correct
19 Correct 13 ms 892 KB Output is correct
20 Correct 8 ms 888 KB Output is correct
21 Correct 315 ms 1656 KB Output is correct
22 Correct 420 ms 1800 KB Output is correct
23 Correct 183 ms 1272 KB Output is correct
24 Correct 658 ms 2168 KB Output is correct
25 Correct 720 ms 2168 KB Output is correct
26 Correct 863 ms 2296 KB Output is correct
27 Correct 572 ms 2168 KB Output is correct
28 Correct 451 ms 2168 KB Output is correct
29 Correct 480 ms 2296 KB Output is correct
30 Correct 801 ms 2296 KB Output is correct
31 Execution timed out 1037 ms 2168 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 6 ms 632 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 15 ms 888 KB Output is correct
13 Correct 15 ms 888 KB Output is correct
14 Correct 18 ms 888 KB Output is correct
15 Correct 14 ms 888 KB Output is correct
16 Correct 16 ms 888 KB Output is correct
17 Correct 9 ms 760 KB Output is correct
18 Correct 13 ms 988 KB Output is correct
19 Correct 13 ms 892 KB Output is correct
20 Correct 8 ms 888 KB Output is correct
21 Correct 315 ms 1656 KB Output is correct
22 Correct 420 ms 1800 KB Output is correct
23 Correct 183 ms 1272 KB Output is correct
24 Correct 658 ms 2168 KB Output is correct
25 Correct 720 ms 2168 KB Output is correct
26 Correct 863 ms 2296 KB Output is correct
27 Correct 572 ms 2168 KB Output is correct
28 Correct 451 ms 2168 KB Output is correct
29 Correct 480 ms 2296 KB Output is correct
30 Correct 801 ms 2296 KB Output is correct
31 Execution timed out 1037 ms 2168 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 6 ms 632 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 15 ms 888 KB Output is correct
13 Correct 15 ms 888 KB Output is correct
14 Correct 18 ms 888 KB Output is correct
15 Correct 14 ms 888 KB Output is correct
16 Correct 16 ms 888 KB Output is correct
17 Correct 9 ms 760 KB Output is correct
18 Correct 13 ms 988 KB Output is correct
19 Correct 13 ms 892 KB Output is correct
20 Correct 8 ms 888 KB Output is correct
21 Correct 315 ms 1656 KB Output is correct
22 Correct 420 ms 1800 KB Output is correct
23 Correct 183 ms 1272 KB Output is correct
24 Correct 658 ms 2168 KB Output is correct
25 Correct 720 ms 2168 KB Output is correct
26 Correct 863 ms 2296 KB Output is correct
27 Correct 572 ms 2168 KB Output is correct
28 Correct 451 ms 2168 KB Output is correct
29 Correct 480 ms 2296 KB Output is correct
30 Correct 801 ms 2296 KB Output is correct
31 Execution timed out 1037 ms 2168 KB Time limit exceeded
32 Halted 0 ms 0 KB -