oj.uz

답안 #522853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
522853 2022-02-06T05:20:03 Z Nursik Bootfall (IZhO17_bootfall) C++14
28 / 100
 1000 ms 588 KB 
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair

const ll maxn = 5e2 + 1, maxm = 3e5 + 1,  maxk = 61;
const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353;
const ll pa = 31, block = 400;

using namespace std;

int n, x, y;
int a[maxn], is[maxm], dp2[maxm];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n;
    dp2[0] = 1;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
        x += a[i];
        for (int j = x; j >= 0; --j){
            if (dp2[j] > 0){
                dp2[j + a[i]] |= dp2[j];
            }
        }
    }
    if (x % 2 != 0){
        cout << 0;
        return 0;
    }
    if (x % 2 == 0 && dp2[x / 2] == 0){
        cout << 0;
        return 0;
    }
    for (int i = 0; i <= x; ++i){
        is[i] = 1;
    }
    for (int i = 1; i <= n; ++i){
        int dp[x + 1], is2[x + 1];
        for (int j = 0; j <= x; ++j){
            dp[j] = 0, is2[j] = 0;
        }
        dp[0] = 1;
        y = x - a[i];
        for (int j = 1; j <= n; ++j){
            if (i != j){
                for (int k = x; k >= 0; --k){
                    if (dp[k] > 0 && k + a[j] <= x){
                        dp[k + a[j]] |= dp[k];
                    }
                }
            }
        }
        for (int k = 0; k <= x; ++k){
            ll z = y - k;
            if (z > 0 && min(dp[z], dp[k]) == 1){
                ll rz = abs(z - k);
                if (is[rz] == 1){
                    is2[rz] = 1;
                }
            }
        }
        for (int k = 0; k <= x; ++k){
            is[k] = is2[k];
        }
    }
    vector<int> v;
    for (int i = 1; i <= x; ++i){
        if (is[i] > 0){
            v.pb(i);
        }
    }
    cout << v.size() << '\n';
    for (auto it : v){
        cout << it << " ";
    }
}
/*
*/

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 28 ms 364 KB Output is correct
22 Correct 43 ms 332 KB Output is correct
23 Correct 12 ms 316 KB Output is correct
24 Correct 85 ms 388 KB Output is correct
25 Correct 137 ms 460 KB Output is correct
26 Correct 154 ms 456 KB Output is correct
27 Correct 113 ms 452 KB Output is correct
28 Correct 118 ms 464 KB Output is correct
29 Correct 122 ms 456 KB Output is correct
30 Correct 117 ms 332 KB Output is correct
31 Correct 154 ms 436 KB Output is correct
32 Correct 105 ms 392 KB Output is correct
33 Correct 124 ms 460 KB Output is correct
34 Correct 110 ms 476 KB Output is correct
35 Correct 118 ms 460 KB Output is correct
36 Correct 99 ms 376 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 28 ms 364 KB Output is correct
22 Correct 43 ms 332 KB Output is correct
23 Correct 12 ms 316 KB Output is correct
24 Correct 85 ms 388 KB Output is correct
25 Correct 137 ms 460 KB Output is correct
26 Correct 154 ms 456 KB Output is correct
27 Correct 113 ms 452 KB Output is correct
28 Correct 118 ms 464 KB Output is correct
29 Correct 122 ms 456 KB Output is correct
30 Correct 117 ms 332 KB Output is correct
31 Correct 154 ms 436 KB Output is correct
32 Correct 105 ms 392 KB Output is correct
33 Correct 124 ms 460 KB Output is correct
34 Correct 110 ms 476 KB Output is correct
35 Correct 118 ms 460 KB Output is correct
36 Correct 99 ms 376 KB Output is correct
37 Execution timed out 1064 ms 588 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 28 ms 364 KB Output is correct
22 Correct 43 ms 332 KB Output is correct
23 Correct 12 ms 316 KB Output is correct
24 Correct 85 ms 388 KB Output is correct
25 Correct 137 ms 460 KB Output is correct
26 Correct 154 ms 456 KB Output is correct
27 Correct 113 ms 452 KB Output is correct
28 Correct 118 ms 464 KB Output is correct
29 Correct 122 ms 456 KB Output is correct
30 Correct 117 ms 332 KB Output is correct
31 Correct 154 ms 436 KB Output is correct
32 Correct 105 ms 392 KB Output is correct
33 Correct 124 ms 460 KB Output is correct
34 Correct 110 ms 476 KB Output is correct
35 Correct 118 ms 460 KB Output is correct
36 Correct 99 ms 376 KB Output is correct
37 Execution timed out 1064 ms 588 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 28 ms 364 KB Output is correct
22 Correct 43 ms 332 KB Output is correct
23 Correct 12 ms 316 KB Output is correct
24 Correct 85 ms 388 KB Output is correct
25 Correct 137 ms 460 KB Output is correct
26 Correct 154 ms 456 KB Output is correct
27 Correct 113 ms 452 KB Output is correct
28 Correct 118 ms 464 KB Output is correct
29 Correct 122 ms 456 KB Output is correct
30 Correct 117 ms 332 KB Output is correct
31 Correct 154 ms 436 KB Output is correct
32 Correct 105 ms 392 KB Output is correct
33 Correct 124 ms 460 KB Output is correct
34 Correct 110 ms 476 KB Output is correct
35 Correct 118 ms 460 KB Output is correct
36 Correct 99 ms 376 KB Output is correct
37 Execution timed out 1064 ms 588 KB Time limit exceeded
38 Halted 0 ms 0 KB -