oj.uz

답안 #675445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675445 2022-12-27T09:14:02 Z LucaIlie Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 6152 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxN = 500;
const int maxS = 500 * 500;

int v[maxN + 1];
bitset<maxS + 1> pos1n[maxN + 1], posn1[maxN + 2];
bitset<maxS + 1> pos, tim, timTemp;

int main() {
    int n, s = 0;

    cin >> n;
    for ( int i = 1; i <= n; i++ )
        cin >> v[i], s += v[i];

    pos1n[0][0] = true;
    for ( int i = 1; i <= n; i++ )
        pos1n[i] = (pos1n[i - 1] | (pos1n[i - 1] << v[i]));
    posn1[n + 1][0] = true;
    for ( int i = n; i >= 1; i-- )
        posn1[i] = (posn1[i + 1] | (posn1[i + 1] << v[i]));

    if ( s % 2 != 0 || !pos1n[n][s / 2] ) {
        cout << 0;
        return 0;
    }

    for ( int i = 0; i <= s; i++ )
        tim[i] = true;
    for ( int r = 1; r <= n; r++ ) {
        pos = pos1n[r - 1];
        for ( int i = 0; i <= s; i++ ) {
            if ( posn1[r + 1][i] )
                pos |= (pos1n[r - 1] << i);
        }

        timTemp.reset();
        for ( int i = 0; i <= s; i++ ) {
            if ( pos[i] )
                timTemp[abs( s - v[r] - i - i )] = true;
        }
        tim &= timTemp;
    }

    tim[0] = false;
    cout << tim.count() << "\n";
    for ( int i = 0; i <= s; i++ ) {
        if ( tim[i] )
            cout << i << " ";
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 13 ms 1212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 13 ms 1108 KB Output is correct
9 Correct 6 ms 980 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 13 ms 1212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 13 ms 1108 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 26 ms 2260 KB Output is correct
12 Correct 20 ms 2260 KB Output is correct
13 Correct 22 ms 2004 KB Output is correct
14 Correct 28 ms 2132 KB Output is correct
15 Correct 25 ms 2132 KB Output is correct
16 Correct 28 ms 2308 KB Output is correct
17 Correct 10 ms 1492 KB Output is correct
18 Correct 19 ms 1940 KB Output is correct
19 Correct 15 ms 2004 KB Output is correct
20 Correct 5 ms 2304 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 13 ms 1212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 13 ms 1108 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 26 ms 2260 KB Output is correct
12 Correct 20 ms 2260 KB Output is correct
13 Correct 22 ms 2004 KB Output is correct
14 Correct 28 ms 2132 KB Output is correct
15 Correct 25 ms 2132 KB Output is correct
16 Correct 28 ms 2308 KB Output is correct
17 Correct 10 ms 1492 KB Output is correct
18 Correct 19 ms 1940 KB Output is correct
19 Correct 15 ms 2004 KB Output is correct
20 Correct 5 ms 2304 KB Output is correct
21 Correct 640 ms 4432 KB Output is correct
22 Correct 765 ms 4984 KB Output is correct
23 Correct 376 ms 3512 KB Output is correct
24 Execution timed out 1090 ms 6152 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 13 ms 1212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 13 ms 1108 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 26 ms 2260 KB Output is correct
12 Correct 20 ms 2260 KB Output is correct
13 Correct 22 ms 2004 KB Output is correct
14 Correct 28 ms 2132 KB Output is correct
15 Correct 25 ms 2132 KB Output is correct
16 Correct 28 ms 2308 KB Output is correct
17 Correct 10 ms 1492 KB Output is correct
18 Correct 19 ms 1940 KB Output is correct
19 Correct 15 ms 2004 KB Output is correct
20 Correct 5 ms 2304 KB Output is correct
21 Correct 640 ms 4432 KB Output is correct
22 Correct 765 ms 4984 KB Output is correct
23 Correct 376 ms 3512 KB Output is correct
24 Execution timed out 1090 ms 6152 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 13 ms 1212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 13 ms 1108 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 26 ms 2260 KB Output is correct
12 Correct 20 ms 2260 KB Output is correct
13 Correct 22 ms 2004 KB Output is correct
14 Correct 28 ms 2132 KB Output is correct
15 Correct 25 ms 2132 KB Output is correct
16 Correct 28 ms 2308 KB Output is correct
17 Correct 10 ms 1492 KB Output is correct
18 Correct 19 ms 1940 KB Output is correct
19 Correct 15 ms 2004 KB Output is correct
20 Correct 5 ms 2304 KB Output is correct
21 Correct 640 ms 4432 KB Output is correct
22 Correct 765 ms 4984 KB Output is correct
23 Correct 376 ms 3512 KB Output is correct
24 Execution timed out 1090 ms 6152 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 13 ms 1212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 13 ms 1108 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 7 ms 2304 KB Output is correct
11 Correct 26 ms 2260 KB Output is correct
12 Correct 20 ms 2260 KB Output is correct
13 Correct 22 ms 2004 KB Output is correct
14 Correct 28 ms 2132 KB Output is correct
15 Correct 25 ms 2132 KB Output is correct
16 Correct 28 ms 2308 KB Output is correct
17 Correct 10 ms 1492 KB Output is correct
18 Correct 19 ms 1940 KB Output is correct
19 Correct 15 ms 2004 KB Output is correct
20 Correct 5 ms 2304 KB Output is correct
21 Correct 640 ms 4432 KB Output is correct
22 Correct 765 ms 4984 KB Output is correct
23 Correct 376 ms 3512 KB Output is correct
24 Execution timed out 1090 ms 6152 KB Time limit exceeded
25 Halted 0 ms 0 KB -