oj.uz

Submission #37473

# Submission time Handle Problem Language Result Execution time Memory
37473 2017-12-25T16:09:50 Z HardNut Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 4820 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 250005;
const int mod = 1e9 + 7;

typedef long long ll;

int n, a[505], sum;
vector<int> vec;
int ans[N];
int dp[N];

void add(int v) {
    for (int i = sum; i >= 0; i--) {
        dp[i + v] += dp[i];
        if (dp[i + v] >= mod)
            dp[i + v] -= mod;
    }
    sum += v;
}

void del(int v) {
    sum -= v;
    for (int i = 0; i <= sum; i++) {
        dp[i + v] = (dp[i + v] - dp[i] + mod);
        if (dp[i + v] >= mod)
            dp[i + v] -= mod;
    }
}

int main() {
//    freopen("bootfall.in", "r", stdin);
//    freopen("bootfall.out", "w", stdout);
    scanf("%d", &n);
    dp[0] = 1;
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        add(a[i]);
    }
    if (sum % 2 == 1) {
        cout << 0;
        return 0;
    }
    for (int i = 1; i <= sum; i++) {
        ans[i] = 1;
    }
    if (!dp[sum / 2]) {
        cout << 0;
        return 0;
    }
    for (int i = 1; i <= n; i++) {
        del(a[i]);
        for (int j = 1; j <= N; j++) {
            if ((sum + j) % 2) {
                ans[j] = 0;
                continue;
            }
            if (!dp[(sum + j) / 2]) {
                ans[j] = 0;
            }
        }
        add(a[i]);
    }
    int cnt = 0;
    for (int i = 1; i <= sum; i++) {
        if (ans[i])
            vec.push_back(i);
    }
    printf("%d\n", vec.size());
    for (int i = 0; i < vec.size(); i++)
        printf("%d ", vec[i]);
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:71:30: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", vec.size());
                              ^
bootfall.cpp:72:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < vec.size(); i++)
                       ^
bootfall.cpp:66:9: warning: unused variable 'cnt' [-Wunused-variable]
     int cnt = 0;
         ^
bootfall.cpp:36:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
bootfall.cpp:39:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
                           ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3968 KB Output is correct
2 Correct 0 ms 3968 KB Output is correct
3 Correct 0 ms 3968 KB Output is correct
4 Correct 0 ms 3968 KB Output is correct
5 Correct 3 ms 3968 KB Output is correct
6 Correct 3 ms 3968 KB Output is correct
7 Correct 0 ms 3968 KB Output is correct
8 Correct 3 ms 3968 KB Output is correct
9 Correct 3 ms 3968 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3968 KB Output is correct
2 Correct 0 ms 3968 KB Output is correct
3 Correct 0 ms 3968 KB Output is correct
4 Correct 0 ms 3968 KB Output is correct
5 Correct 3 ms 3968 KB Output is correct
6 Correct 3 ms 3968 KB Output is correct
7 Correct 0 ms 3968 KB Output is correct
8 Correct 3 ms 3968 KB Output is correct
9 Correct 3 ms 3968 KB Output is correct
10 Correct 6 ms 3968 KB Output is correct
11 Correct 6 ms 3968 KB Output is correct
12 Correct 16 ms 3968 KB Output is correct
13 Correct 6 ms 3968 KB Output is correct
14 Correct 6 ms 3968 KB Output is correct
15 Correct 6 ms 3968 KB Output is correct
16 Correct 9 ms 3968 KB Output is correct
17 Correct 3 ms 3968 KB Output is correct
18 Correct 3 ms 3968 KB Output is correct
19 Correct 6 ms 3968 KB Output is correct
20 Correct 6 ms 3968 KB Output is correct
21 Correct 19 ms 3968 KB Output is correct
22 Correct 23 ms 3968 KB Output is correct
23 Correct 13 ms 3968 KB Output is correct
24 Correct 29 ms 3968 KB Output is correct
25 Correct 33 ms 3968 KB Output is correct
26 Correct 36 ms 3968 KB Output is correct
27 Correct 39 ms 3968 KB Output is correct
28 Correct 39 ms 3968 KB Output is correct
29 Correct 36 ms 3968 KB Output is correct
30 Correct 33 ms 3968 KB Output is correct
31 Correct 33 ms 3968 KB Output is correct
32 Correct 33 ms 3968 KB Output is correct
33 Correct 33 ms 3968 KB Output is correct
34 Correct 29 ms 3968 KB Output is correct
35 Correct 33 ms 3968 KB Output is correct
36 Correct 33 ms 3968 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3968 KB Output is correct
2 Correct 0 ms 3968 KB Output is correct
3 Correct 0 ms 3968 KB Output is correct
4 Correct 0 ms 3968 KB Output is correct
5 Correct 3 ms 3968 KB Output is correct
6 Correct 3 ms 3968 KB Output is correct
7 Correct 0 ms 3968 KB Output is correct
8 Correct 3 ms 3968 KB Output is correct
9 Correct 3 ms 3968 KB Output is correct
10 Correct 6 ms 3968 KB Output is correct
11 Correct 6 ms 3968 KB Output is correct
12 Correct 16 ms 3968 KB Output is correct
13 Correct 6 ms 3968 KB Output is correct
14 Correct 6 ms 3968 KB Output is correct
15 Correct 6 ms 3968 KB Output is correct
16 Correct 9 ms 3968 KB Output is correct
17 Correct 3 ms 3968 KB Output is correct
18 Correct 3 ms 3968 KB Output is correct
19 Correct 6 ms 3968 KB Output is correct
20 Correct 6 ms 3968 KB Output is correct
21 Correct 19 ms 3968 KB Output is correct
22 Correct 23 ms 3968 KB Output is correct
23 Correct 13 ms 3968 KB Output is correct
24 Correct 29 ms 3968 KB Output is correct
25 Correct 33 ms 3968 KB Output is correct
26 Correct 36 ms 3968 KB Output is correct
27 Correct 39 ms 3968 KB Output is correct
28 Correct 39 ms 3968 KB Output is correct
29 Correct 36 ms 3968 KB Output is correct
30 Correct 33 ms 3968 KB Output is correct
31 Correct 33 ms 3968 KB Output is correct
32 Correct 33 ms 3968 KB Output is correct
33 Correct 33 ms 3968 KB Output is correct
34 Correct 29 ms 3968 KB Output is correct
35 Correct 33 ms 3968 KB Output is correct
36 Correct 33 ms 3968 KB Output is correct
37 Correct 109 ms 4108 KB Output is correct
38 Correct 103 ms 4108 KB Output is correct
39 Correct 149 ms 3968 KB Output is correct
40 Correct 183 ms 4108 KB Output is correct
41 Correct 189 ms 3968 KB Output is correct
42 Correct 153 ms 4108 KB Output is correct
43 Correct 229 ms 4240 KB Output is correct
44 Correct 216 ms 4240 KB Output is correct
45 Correct 229 ms 4240 KB Output is correct
46 Correct 159 ms 3968 KB Output is correct
47 Correct 169 ms 4108 KB Output is correct
48 Correct 216 ms 4240 KB Output is correct
49 Correct 216 ms 4108 KB Output is correct
50 Correct 169 ms 4108 KB Output is correct
51 Correct 23 ms 3968 KB Output is correct
52 Correct 289 ms 4240 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3968 KB Output is correct
2 Correct 0 ms 3968 KB Output is correct
3 Correct 0 ms 3968 KB Output is correct
4 Correct 0 ms 3968 KB Output is correct
5 Correct 3 ms 3968 KB Output is correct
6 Correct 3 ms 3968 KB Output is correct
7 Correct 0 ms 3968 KB Output is correct
8 Correct 3 ms 3968 KB Output is correct
9 Correct 3 ms 3968 KB Output is correct
10 Correct 6 ms 3968 KB Output is correct
11 Correct 6 ms 3968 KB Output is correct
12 Correct 16 ms 3968 KB Output is correct
13 Correct 6 ms 3968 KB Output is correct
14 Correct 6 ms 3968 KB Output is correct
15 Correct 6 ms 3968 KB Output is correct
16 Correct 9 ms 3968 KB Output is correct
17 Correct 3 ms 3968 KB Output is correct
18 Correct 3 ms 3968 KB Output is correct
19 Correct 6 ms 3968 KB Output is correct
20 Correct 6 ms 3968 KB Output is correct
21 Correct 19 ms 3968 KB Output is correct
22 Correct 23 ms 3968 KB Output is correct
23 Correct 13 ms 3968 KB Output is correct
24 Correct 29 ms 3968 KB Output is correct
25 Correct 33 ms 3968 KB Output is correct
26 Correct 36 ms 3968 KB Output is correct
27 Correct 39 ms 3968 KB Output is correct
28 Correct 39 ms 3968 KB Output is correct
29 Correct 36 ms 3968 KB Output is correct
30 Correct 33 ms 3968 KB Output is correct
31 Correct 33 ms 3968 KB Output is correct
32 Correct 33 ms 3968 KB Output is correct
33 Correct 33 ms 3968 KB Output is correct
34 Correct 29 ms 3968 KB Output is correct
35 Correct 33 ms 3968 KB Output is correct
36 Correct 33 ms 3968 KB Output is correct
37 Correct 109 ms 4108 KB Output is correct
38 Correct 103 ms 4108 KB Output is correct
39 Correct 149 ms 3968 KB Output is correct
40 Correct 183 ms 4108 KB Output is correct
41 Correct 189 ms 3968 KB Output is correct
42 Correct 153 ms 4108 KB Output is correct
43 Correct 229 ms 4240 KB Output is correct
44 Correct 216 ms 4240 KB Output is correct
45 Correct 229 ms 4240 KB Output is correct
46 Correct 159 ms 3968 KB Output is correct
47 Correct 169 ms 4108 KB Output is correct
48 Correct 216 ms 4240 KB Output is correct
49 Correct 216 ms 4108 KB Output is correct
50 Correct 169 ms 4108 KB Output is correct
51 Correct 23 ms 3968 KB Output is correct
52 Correct 289 ms 4240 KB Output is correct
53 Correct 249 ms 4240 KB Output is correct
54 Correct 326 ms 4240 KB Output is correct
55 Correct 543 ms 4436 KB Output is correct
56 Correct 299 ms 4240 KB Output is correct
57 Correct 569 ms 4436 KB Output is correct
58 Correct 356 ms 4240 KB Output is correct
59 Correct 409 ms 4436 KB Output is correct
60 Correct 66 ms 3968 KB Output is correct
61 Correct 476 ms 4436 KB Output is correct
62 Correct 479 ms 4436 KB Output is correct
63 Correct 493 ms 4436 KB Output is correct
64 Correct 449 ms 4436 KB Output is correct
65 Correct 163 ms 3968 KB Output is correct
66 Correct 199 ms 4108 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3968 KB Output is correct
2 Correct 0 ms 3968 KB Output is correct
3 Correct 0 ms 3968 KB Output is correct
4 Correct 0 ms 3968 KB Output is correct
5 Correct 3 ms 3968 KB Output is correct
6 Correct 3 ms 3968 KB Output is correct
7 Correct 0 ms 3968 KB Output is correct
8 Correct 3 ms 3968 KB Output is correct
9 Correct 3 ms 3968 KB Output is correct
10 Correct 6 ms 3968 KB Output is correct
11 Correct 6 ms 3968 KB Output is correct
12 Correct 16 ms 3968 KB Output is correct
13 Correct 6 ms 3968 KB Output is correct
14 Correct 6 ms 3968 KB Output is correct
15 Correct 6 ms 3968 KB Output is correct
16 Correct 9 ms 3968 KB Output is correct
17 Correct 3 ms 3968 KB Output is correct
18 Correct 3 ms 3968 KB Output is correct
19 Correct 6 ms 3968 KB Output is correct
20 Correct 6 ms 3968 KB Output is correct
21 Correct 19 ms 3968 KB Output is correct
22 Correct 23 ms 3968 KB Output is correct
23 Correct 13 ms 3968 KB Output is correct
24 Correct 29 ms 3968 KB Output is correct
25 Correct 33 ms 3968 KB Output is correct
26 Correct 36 ms 3968 KB Output is correct
27 Correct 39 ms 3968 KB Output is correct
28 Correct 39 ms 3968 KB Output is correct
29 Correct 36 ms 3968 KB Output is correct
30 Correct 33 ms 3968 KB Output is correct
31 Correct 33 ms 3968 KB Output is correct
32 Correct 33 ms 3968 KB Output is correct
33 Correct 33 ms 3968 KB Output is correct
34 Correct 29 ms 3968 KB Output is correct
35 Correct 33 ms 3968 KB Output is correct
36 Correct 33 ms 3968 KB Output is correct
37 Correct 109 ms 4108 KB Output is correct
38 Correct 103 ms 4108 KB Output is correct
39 Correct 149 ms 3968 KB Output is correct
40 Correct 183 ms 4108 KB Output is correct
41 Correct 189 ms 3968 KB Output is correct
42 Correct 153 ms 4108 KB Output is correct
43 Correct 229 ms 4240 KB Output is correct
44 Correct 216 ms 4240 KB Output is correct
45 Correct 229 ms 4240 KB Output is correct
46 Correct 159 ms 3968 KB Output is correct
47 Correct 169 ms 4108 KB Output is correct
48 Correct 216 ms 4240 KB Output is correct
49 Correct 216 ms 4108 KB Output is correct
50 Correct 169 ms 4108 KB Output is correct
51 Correct 23 ms 3968 KB Output is correct
52 Correct 289 ms 4240 KB Output is correct
53 Correct 249 ms 4240 KB Output is correct
54 Correct 326 ms 4240 KB Output is correct
55 Correct 543 ms 4436 KB Output is correct
56 Correct 299 ms 4240 KB Output is correct
57 Correct 569 ms 4436 KB Output is correct
58 Correct 356 ms 4240 KB Output is correct
59 Correct 409 ms 4436 KB Output is correct
60 Correct 66 ms 3968 KB Output is correct
61 Correct 476 ms 4436 KB Output is correct
62 Correct 479 ms 4436 KB Output is correct
63 Correct 493 ms 4436 KB Output is correct
64 Correct 449 ms 4436 KB Output is correct
65 Correct 163 ms 3968 KB Output is correct
66 Correct 199 ms 4108 KB Output is correct
67 Correct 486 ms 4436 KB Output is correct
68 Correct 123 ms 3968 KB Output is correct
69 Execution timed out 1000 ms 4820 KB Execution timed out
70 Halted 0 ms 0 KB -