oj.uz

Submission #38272

# Submission time Handle Problem Language Result Execution time Memory
38272 2018-01-03T10:26:20 Z Talant Bootfall (IZhO17_bootfall) C++14
100 / 100
 269 ms 22400 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

typedef long long ll;

const ll inf = (ll)1e9 + 7;
const int N = (int)1e6 + 1;
const int M = (int)250001;

int n;
int a[N],sum;
int p[N],dp[N];
int cur[N];
int used[N];

vector <int> ans;

int main () {
        cin >> n;

        for (int i = 1; i <= n; i ++) {
                scanf ("%d", &a[i]);
                sum += a[i];
                p[i] = p[i - 1] + a[i];
        }

        if (sum & 1) {
                cout << 0;
                return 0;
        }
        dp[0] = 1;

        for (int i = 1; i <= n; i ++)
                for (int j = p[i]; j >= a[i]; j --)
                        dp[j] += dp[j - a[i]];

        if (!dp[sum / 2]) {
                cout << 0;
                return 0;
        }
        for (int i = 1; i <= sum; i ++)
                cur[i] = 1;

        for (int i = 1; i <= n; i ++) {
                if (used[a[i]])
                        continue;

                used[a[i]] = 1;
                sum -= a[i];

                for (int j = 0; j <= sum; j ++)
                        dp[j + a[i]] -= dp[j];

                for (int j = 1; j <= p[n]; j ++) {
                        if ((sum + j) % 2) {
                                cur[j] = 0;
                                continue;
                        }
                        if (!dp[(sum + j) / 2]) {
                                cur[j] = 0;
                                continue;
                        }
                }
                for (int j = sum; j >= 0; j --)
                        dp[j + a[i]] += dp[j];

                sum += a[i];
        }
        for (int i = 1; i <= p[n]; i ++)
                if (cur[i] == 1)
                        ans.pb(i);

        cout << ans.size() << endl;

        for (int i = 0; i < ans.size(); i ++)
                cout << ans[i] << " ";
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:82:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < ans.size(); i ++)
                           ^
bootfall.cpp:29:36: 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 21548 KB Output is correct
2 Correct 0 ms 21548 KB Output is correct
3 Correct 0 ms 21548 KB Output is correct
4 Correct 0 ms 21548 KB Output is correct
5 Correct 0 ms 21548 KB Output is correct
6 Correct 0 ms 21548 KB Output is correct
7 Correct 0 ms 21548 KB Output is correct
8 Correct 0 ms 21548 KB Output is correct
9 Correct 0 ms 21548 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 21548 KB Output is correct
2 Correct 0 ms 21548 KB Output is correct
3 Correct 0 ms 21548 KB Output is correct
4 Correct 0 ms 21548 KB Output is correct
5 Correct 0 ms 21548 KB Output is correct
6 Correct 0 ms 21548 KB Output is correct
7 Correct 0 ms 21548 KB Output is correct
8 Correct 0 ms 21548 KB Output is correct
9 Correct 0 ms 21548 KB Output is correct
10 Correct 0 ms 21548 KB Output is correct
11 Correct 0 ms 21548 KB Output is correct
12 Correct 0 ms 21548 KB Output is correct
13 Correct 0 ms 21548 KB Output is correct
14 Correct 0 ms 21548 KB Output is correct
15 Correct 0 ms 21548 KB Output is correct
16 Correct 0 ms 21548 KB Output is correct
17 Correct 0 ms 21548 KB Output is correct
18 Correct 0 ms 21548 KB Output is correct
19 Correct 0 ms 21548 KB Output is correct
20 Correct 0 ms 21548 KB Output is correct
21 Correct 0 ms 21548 KB Output is correct
22 Correct 0 ms 21548 KB Output is correct
23 Correct 0 ms 21548 KB Output is correct
24 Correct 0 ms 21548 KB Output is correct
25 Correct 0 ms 21548 KB Output is correct
26 Correct 0 ms 21548 KB Output is correct
27 Correct 0 ms 21548 KB Output is correct
28 Correct 0 ms 21548 KB Output is correct
29 Correct 0 ms 21548 KB Output is correct
30 Correct 0 ms 21548 KB Output is correct
31 Correct 0 ms 21548 KB Output is correct
32 Correct 0 ms 21548 KB Output is correct
33 Correct 0 ms 21548 KB Output is correct
34 Correct 0 ms 21548 KB Output is correct
35 Correct 0 ms 21548 KB Output is correct
36 Correct 0 ms 21548 KB Output is correct
37 Correct 6 ms 21688 KB Output is correct
38 Correct 9 ms 21688 KB Output is correct
39 Correct 9 ms 21548 KB Output is correct
40 Correct 23 ms 21688 KB Output is correct
41 Correct 13 ms 21548 KB Output is correct
42 Correct 16 ms 21688 KB Output is correct
43 Correct 16 ms 21820 KB Output is correct
44 Correct 16 ms 21820 KB Output is correct
45 Correct 23 ms 21820 KB Output is correct
46 Correct 23 ms 21548 KB Output is correct
47 Correct 19 ms 21688 KB Output is correct
48 Correct 13 ms 21820 KB Output is correct
49 Correct 13 ms 21688 KB Output is correct
50 Correct 29 ms 21688 KB Output is correct
51 Correct 0 ms 21548 KB Output is correct
52 Correct 13 ms 21820 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 21548 KB Output is correct
2 Correct 0 ms 21548 KB Output is correct
3 Correct 0 ms 21548 KB Output is correct
4 Correct 0 ms 21548 KB Output is correct
5 Correct 0 ms 21548 KB Output is correct
6 Correct 0 ms 21548 KB Output is correct
7 Correct 0 ms 21548 KB Output is correct
8 Correct 0 ms 21548 KB Output is correct
9 Correct 0 ms 21548 KB Output is correct
10 Correct 0 ms 21548 KB Output is correct
11 Correct 0 ms 21548 KB Output is correct
12 Correct 0 ms 21548 KB Output is correct
13 Correct 0 ms 21548 KB Output is correct
14 Correct 0 ms 21548 KB Output is correct
15 Correct 0 ms 21548 KB Output is correct
16 Correct 0 ms 21548 KB Output is correct
17 Correct 0 ms 21548 KB Output is correct
18 Correct 0 ms 21548 KB Output is correct
19 Correct 0 ms 21548 KB Output is correct
20 Correct 0 ms 21548 KB Output is correct
21 Correct 0 ms 21548 KB Output is correct
22 Correct 0 ms 21548 KB Output is correct
23 Correct 0 ms 21548 KB Output is correct
24 Correct 0 ms 21548 KB Output is correct
25 Correct 0 ms 21548 KB Output is correct
26 Correct 0 ms 21548 KB Output is correct
27 Correct 0 ms 21548 KB Output is correct
28 Correct 0 ms 21548 KB Output is correct
29 Correct 0 ms 21548 KB Output is correct
30 Correct 0 ms 21548 KB Output is correct
31 Correct 0 ms 21548 KB Output is correct
32 Correct 0 ms 21548 KB Output is correct
33 Correct 0 ms 21548 KB Output is correct
34 Correct 0 ms 21548 KB Output is correct
35 Correct 0 ms 21548 KB Output is correct
36 Correct 0 ms 21548 KB Output is correct
37 Correct 6 ms 21688 KB Output is correct
38 Correct 9 ms 21688 KB Output is correct
39 Correct 9 ms 21548 KB Output is correct
40 Correct 23 ms 21688 KB Output is correct
41 Correct 13 ms 21548 KB Output is correct
42 Correct 16 ms 21688 KB Output is correct
43 Correct 16 ms 21820 KB Output is correct
44 Correct 16 ms 21820 KB Output is correct
45 Correct 23 ms 21820 KB Output is correct
46 Correct 23 ms 21548 KB Output is correct
47 Correct 19 ms 21688 KB Output is correct
48 Correct 13 ms 21820 KB Output is correct
49 Correct 13 ms 21688 KB Output is correct
50 Correct 29 ms 21688 KB Output is correct
51 Correct 0 ms 21548 KB Output is correct
52 Correct 13 ms 21820 KB Output is correct
53 Correct 33 ms 21820 KB Output is correct
54 Correct 43 ms 21820 KB Output is correct
55 Correct 26 ms 22016 KB Output is correct
56 Correct 36 ms 21820 KB Output is correct
57 Correct 39 ms 22016 KB Output is correct
58 Correct 49 ms 21820 KB Output is correct
59 Correct 43 ms 22016 KB Output is correct
60 Correct 0 ms 21548 KB Output is correct
61 Correct 49 ms 22016 KB Output is correct
62 Correct 43 ms 22016 KB Output is correct
63 Correct 43 ms 22016 KB Output is correct
64 Correct 39 ms 22016 KB Output is correct
65 Correct 9 ms 21548 KB Output is correct
66 Correct 23 ms 21688 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 21548 KB Output is correct
2 Correct 0 ms 21548 KB Output is correct
3 Correct 0 ms 21548 KB Output is correct
4 Correct 0 ms 21548 KB Output is correct
5 Correct 0 ms 21548 KB Output is correct
6 Correct 0 ms 21548 KB Output is correct
7 Correct 0 ms 21548 KB Output is correct
8 Correct 0 ms 21548 KB Output is correct
9 Correct 0 ms 21548 KB Output is correct
10 Correct 0 ms 21548 KB Output is correct
11 Correct 0 ms 21548 KB Output is correct
12 Correct 0 ms 21548 KB Output is correct
13 Correct 0 ms 21548 KB Output is correct
14 Correct 0 ms 21548 KB Output is correct
15 Correct 0 ms 21548 KB Output is correct
16 Correct 0 ms 21548 KB Output is correct
17 Correct 0 ms 21548 KB Output is correct
18 Correct 0 ms 21548 KB Output is correct
19 Correct 0 ms 21548 KB Output is correct
20 Correct 0 ms 21548 KB Output is correct
21 Correct 0 ms 21548 KB Output is correct
22 Correct 0 ms 21548 KB Output is correct
23 Correct 0 ms 21548 KB Output is correct
24 Correct 0 ms 21548 KB Output is correct
25 Correct 0 ms 21548 KB Output is correct
26 Correct 0 ms 21548 KB Output is correct
27 Correct 0 ms 21548 KB Output is correct
28 Correct 0 ms 21548 KB Output is correct
29 Correct 0 ms 21548 KB Output is correct
30 Correct 0 ms 21548 KB Output is correct
31 Correct 0 ms 21548 KB Output is correct
32 Correct 0 ms 21548 KB Output is correct
33 Correct 0 ms 21548 KB Output is correct
34 Correct 0 ms 21548 KB Output is correct
35 Correct 0 ms 21548 KB Output is correct
36 Correct 0 ms 21548 KB Output is correct
37 Correct 6 ms 21688 KB Output is correct
38 Correct 9 ms 21688 KB Output is correct
39 Correct 9 ms 21548 KB Output is correct
40 Correct 23 ms 21688 KB Output is correct
41 Correct 13 ms 21548 KB Output is correct
42 Correct 16 ms 21688 KB Output is correct
43 Correct 16 ms 21820 KB Output is correct
44 Correct 16 ms 21820 KB Output is correct
45 Correct 23 ms 21820 KB Output is correct
46 Correct 23 ms 21548 KB Output is correct
47 Correct 19 ms 21688 KB Output is correct
48 Correct 13 ms 21820 KB Output is correct
49 Correct 13 ms 21688 KB Output is correct
50 Correct 29 ms 21688 KB Output is correct
51 Correct 0 ms 21548 KB Output is correct
52 Correct 13 ms 21820 KB Output is correct
53 Correct 33 ms 21820 KB Output is correct
54 Correct 43 ms 21820 KB Output is correct
55 Correct 26 ms 22016 KB Output is correct
56 Correct 36 ms 21820 KB Output is correct
57 Correct 39 ms 22016 KB Output is correct
58 Correct 49 ms 21820 KB Output is correct
59 Correct 43 ms 22016 KB Output is correct
60 Correct 0 ms 21548 KB Output is correct
61 Correct 49 ms 22016 KB Output is correct
62 Correct 43 ms 22016 KB Output is correct
63 Correct 43 ms 22016 KB Output is correct
64 Correct 39 ms 22016 KB Output is correct
65 Correct 9 ms 21548 KB Output is correct
66 Correct 23 ms 21688 KB Output is correct
67 Correct 76 ms 22016 KB Output is correct
68 Correct 36 ms 21548 KB Output is correct
69 Correct 119 ms 22400 KB Output is correct
70 Correct 169 ms 22016 KB Output is correct
71 Correct 183 ms 22016 KB Output is correct
72 Correct 259 ms 21548 KB Output is correct
73 Correct 269 ms 21548 KB Output is correct
74 Correct 126 ms 22400 KB Output is correct
75 Correct 153 ms 22400 KB Output is correct
76 Correct 96 ms 22400 KB Output is correct
77 Correct 113 ms 22400 KB Output is correct