oj.uz

Submission #850201

# Submission time Handle Problem Language Result Execution time Memory
850201 2023-09-16T02:39:02 Z vjudge1 Bootfall (IZhO17_bootfall) C++17
100 / 100
 279 ms 3120 KB 
#include <bits/stdc++.h>
#define TASK "esport"

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ll> ill;
typedef pair<ll, int> lli;
typedef pair<ll, ll> pll;

const int MAX = 501;
const int SQMAX = 250001;

int n, a[MAX];
int sum;
ll dp[SQMAX];
bool check[SQMAX];

int main()
{
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);

        if (fopen(TASK ".inp", "r"))
        {
                freopen(TASK ".inp", "r", stdin);
                freopen(TASK ".out", "w", stdout);
        }

        cin >> n;
        for (int i = 1; i <= n; ++i)
                cin >> a[i];

        sum = accumulate(a + 1, a + n + 1, 0);
        dp[0] = 1;
        for (int i = 1; i <= n; ++i)
                for (int j = sum - a[i]; j >= 0; --j)
                        dp[j + a[i]] += dp[j];

        if (sum % 2 || !dp[sum / 2])
                return cout << 0, 0;

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

        cout << accumulate(check, check + sum + 1, 0) << '\n';
        for (int i = 0; i <= sum; ++i)
                if (check[i])
                        cout << i << ' ';
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:28:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |                 freopen(TASK ".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:29:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |                 freopen(TASK ".out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 396 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 2 ms 508 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 10 ms 604 KB Output is correct
38 Correct 10 ms 604 KB Output is correct
39 Correct 36 ms 860 KB Output is correct
40 Correct 21 ms 600 KB Output is correct
41 Correct 48 ms 1108 KB Output is correct
42 Correct 18 ms 600 KB Output is correct
43 Correct 32 ms 932 KB Output is correct
44 Correct 37 ms 860 KB Output is correct
45 Correct 34 ms 956 KB Output is correct
46 Correct 21 ms 740 KB Output is correct
47 Correct 21 ms 752 KB Output is correct
48 Correct 36 ms 856 KB Output is correct
49 Correct 37 ms 860 KB Output is correct
50 Correct 20 ms 600 KB Output is correct
51 Correct 4 ms 604 KB Output is correct
52 Correct 48 ms 1064 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 396 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 2 ms 508 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 10 ms 604 KB Output is correct
38 Correct 10 ms 604 KB Output is correct
39 Correct 36 ms 860 KB Output is correct
40 Correct 21 ms 600 KB Output is correct
41 Correct 48 ms 1108 KB Output is correct
42 Correct 18 ms 600 KB Output is correct
43 Correct 32 ms 932 KB Output is correct
44 Correct 37 ms 860 KB Output is correct
45 Correct 34 ms 956 KB Output is correct
46 Correct 21 ms 740 KB Output is correct
47 Correct 21 ms 752 KB Output is correct
48 Correct 36 ms 856 KB Output is correct
49 Correct 37 ms 860 KB Output is correct
50 Correct 20 ms 600 KB Output is correct
51 Correct 4 ms 604 KB Output is correct
52 Correct 48 ms 1064 KB Output is correct
53 Correct 32 ms 856 KB Output is correct
54 Correct 47 ms 940 KB Output is correct
55 Correct 92 ms 1620 KB Output is correct
56 Correct 41 ms 856 KB Output is correct
57 Correct 100 ms 1720 KB Output is correct
58 Correct 50 ms 1104 KB Output is correct
59 Correct 62 ms 1112 KB Output is correct
60 Correct 10 ms 856 KB Output is correct
61 Correct 72 ms 1196 KB Output is correct
62 Correct 74 ms 1364 KB Output is correct
63 Correct 78 ms 1612 KB Output is correct
64 Correct 78 ms 1596 KB Output is correct
65 Correct 38 ms 856 KB Output is correct
66 Correct 53 ms 856 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 396 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 2 ms 508 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 10 ms 604 KB Output is correct
38 Correct 10 ms 604 KB Output is correct
39 Correct 36 ms 860 KB Output is correct
40 Correct 21 ms 600 KB Output is correct
41 Correct 48 ms 1108 KB Output is correct
42 Correct 18 ms 600 KB Output is correct
43 Correct 32 ms 932 KB Output is correct
44 Correct 37 ms 860 KB Output is correct
45 Correct 34 ms 956 KB Output is correct
46 Correct 21 ms 740 KB Output is correct
47 Correct 21 ms 752 KB Output is correct
48 Correct 36 ms 856 KB Output is correct
49 Correct 37 ms 860 KB Output is correct
50 Correct 20 ms 600 KB Output is correct
51 Correct 4 ms 604 KB Output is correct
52 Correct 48 ms 1064 KB Output is correct
53 Correct 32 ms 856 KB Output is correct
54 Correct 47 ms 940 KB Output is correct
55 Correct 92 ms 1620 KB Output is correct
56 Correct 41 ms 856 KB Output is correct
57 Correct 100 ms 1720 KB Output is correct
58 Correct 50 ms 1104 KB Output is correct
59 Correct 62 ms 1112 KB Output is correct
60 Correct 10 ms 856 KB Output is correct
61 Correct 72 ms 1196 KB Output is correct
62 Correct 74 ms 1364 KB Output is correct
63 Correct 78 ms 1612 KB Output is correct
64 Correct 78 ms 1596 KB Output is correct
65 Correct 38 ms 856 KB Output is correct
66 Correct 53 ms 856 KB Output is correct
67 Correct 74 ms 1140 KB Output is correct
68 Correct 29 ms 1368 KB Output is correct
69 Correct 253 ms 2884 KB Output is correct
70 Correct 161 ms 1824 KB Output is correct
71 Correct 160 ms 1684 KB Output is correct
72 Correct 139 ms 1372 KB Output is correct
73 Correct 139 ms 1544 KB Output is correct
74 Correct 260 ms 3092 KB Output is correct
75 Correct 198 ms 2388 KB Output is correct
76 Correct 279 ms 3120 KB Output is correct
77 Correct 276 ms 3060 KB Output is correct