oj.uz

Submission #572813

# Submission time Handle Problem Language Result Execution time Memory
572813 2022-06-05T10:27:50 Z vovamr Bootfall (IZhO17_bootfall) C++17
100 / 100
 948 ms 3408 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

const int N = 550;
const int MX = N * N;
int a[N]; pii dp[MX + 1];

const int md1 = 1e9 + 9;
const int md2 = 998244353;
inline void add1(int &a, int b) { a += b; if (a >= md1){a -= md1;} }
inline void sub1(int &a, int b) { a -= b; if (a < 0){a += md1;} }
inline void add2(int &a, int b) { a += b; if (a >= md2){a -= md2;} }
inline void sub2(int &a, int b) { a -= b; if (a < 0){a += md2;} }
inline void add(pii &a, pii b) { add1(a.fi, b.fi), add2(a.se, b.se); }
inline void sub(pii &a, pii b) { sub1(a.fi, b.fi), sub2(a.se, b.se); }

inline void solve() {
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) cin >> a[i];

	dp[0] = {1, 1};
	for (int i = 0; i < n; ++i) {
		for (int j = MX - a[i]; ~j; --j) {
			add(dp[a[i] + j], dp[j]);
		}
	}

	int s = accumulate(a, a + n, 0);
	if (!dp[s >> 1].fi && !dp[s >> 1].se) return void(cout << 0);

	bitset<MX> res; res.set();

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j <= MX - a[i]; ++j) {
			sub(dp[a[i] + j], dp[j]);
		}
		bitset<MX> now;
		for (int x = 0; x < MX; ++x) {
			if ((s - a[i] + x) & 1) continue;
			if (dp[(s - a[i] + x) >> 1].fi || dp[(s - a[i] + x) >> 1].se) now.set(x);
		}
		res &= now;

		for (int j = MX - a[i]; ~j; --j) {
			add(dp[a[i] + j], dp[j]);
		}
	}

	int ans = res.count();

	cout << ans << '\n';
	int pos = res._Find_first();

	for (int i = 0; i < ans; ++i) {
		cout << pos << " ";
		pos = res._Find_next(pos);
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2768 KB Output is correct
2 Correct 12 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 9 ms 2644 KB Output is correct
5 Correct 24 ms 2768 KB Output is correct
6 Correct 18 ms 2644 KB Output is correct
7 Correct 12 ms 2644 KB Output is correct
8 Correct 23 ms 2772 KB Output is correct
9 Correct 19 ms 2768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2768 KB Output is correct
2 Correct 12 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 9 ms 2644 KB Output is correct
5 Correct 24 ms 2768 KB Output is correct
6 Correct 18 ms 2644 KB Output is correct
7 Correct 12 ms 2644 KB Output is correct
8 Correct 23 ms 2772 KB Output is correct
9 Correct 19 ms 2768 KB Output is correct
10 Correct 71 ms 2644 KB Output is correct
11 Correct 57 ms 2752 KB Output is correct
12 Correct 55 ms 2744 KB Output is correct
13 Correct 47 ms 2644 KB Output is correct
14 Correct 53 ms 2744 KB Output is correct
15 Correct 55 ms 2744 KB Output is correct
16 Correct 72 ms 2744 KB Output is correct
17 Correct 35 ms 2644 KB Output is correct
18 Correct 48 ms 2644 KB Output is correct
19 Correct 49 ms 2740 KB Output is correct
20 Correct 60 ms 2644 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2768 KB Output is correct
2 Correct 12 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 9 ms 2644 KB Output is correct
5 Correct 24 ms 2768 KB Output is correct
6 Correct 18 ms 2644 KB Output is correct
7 Correct 12 ms 2644 KB Output is correct
8 Correct 23 ms 2772 KB Output is correct
9 Correct 19 ms 2768 KB Output is correct
10 Correct 71 ms 2644 KB Output is correct
11 Correct 57 ms 2752 KB Output is correct
12 Correct 55 ms 2744 KB Output is correct
13 Correct 47 ms 2644 KB Output is correct
14 Correct 53 ms 2744 KB Output is correct
15 Correct 55 ms 2744 KB Output is correct
16 Correct 72 ms 2744 KB Output is correct
17 Correct 35 ms 2644 KB Output is correct
18 Correct 48 ms 2644 KB Output is correct
19 Correct 49 ms 2740 KB Output is correct
20 Correct 60 ms 2644 KB Output is correct
21 Correct 121 ms 2744 KB Output is correct
22 Correct 136 ms 2740 KB Output is correct
23 Correct 91 ms 2736 KB Output is correct
24 Correct 166 ms 2740 KB Output is correct
25 Correct 188 ms 2740 KB Output is correct
26 Correct 191 ms 2740 KB Output is correct
27 Correct 175 ms 2744 KB Output is correct
28 Correct 180 ms 2740 KB Output is correct
29 Correct 177 ms 2740 KB Output is correct
30 Correct 182 ms 2744 KB Output is correct
31 Correct 177 ms 2764 KB Output is correct
32 Correct 198 ms 2744 KB Output is correct
33 Correct 183 ms 2644 KB Output is correct
34 Correct 174 ms 2736 KB Output is correct
35 Correct 185 ms 2644 KB Output is correct
36 Correct 195 ms 2744 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2768 KB Output is correct
2 Correct 12 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 9 ms 2644 KB Output is correct
5 Correct 24 ms 2768 KB Output is correct
6 Correct 18 ms 2644 KB Output is correct
7 Correct 12 ms 2644 KB Output is correct
8 Correct 23 ms 2772 KB Output is correct
9 Correct 19 ms 2768 KB Output is correct
10 Correct 71 ms 2644 KB Output is correct
11 Correct 57 ms 2752 KB Output is correct
12 Correct 55 ms 2744 KB Output is correct
13 Correct 47 ms 2644 KB Output is correct
14 Correct 53 ms 2744 KB Output is correct
15 Correct 55 ms 2744 KB Output is correct
16 Correct 72 ms 2744 KB Output is correct
17 Correct 35 ms 2644 KB Output is correct
18 Correct 48 ms 2644 KB Output is correct
19 Correct 49 ms 2740 KB Output is correct
20 Correct 60 ms 2644 KB Output is correct
21 Correct 121 ms 2744 KB Output is correct
22 Correct 136 ms 2740 KB Output is correct
23 Correct 91 ms 2736 KB Output is correct
24 Correct 166 ms 2740 KB Output is correct
25 Correct 188 ms 2740 KB Output is correct
26 Correct 191 ms 2740 KB Output is correct
27 Correct 175 ms 2744 KB Output is correct
28 Correct 180 ms 2740 KB Output is correct
29 Correct 177 ms 2740 KB Output is correct
30 Correct 182 ms 2744 KB Output is correct
31 Correct 177 ms 2764 KB Output is correct
32 Correct 198 ms 2744 KB Output is correct
33 Correct 183 ms 2644 KB Output is correct
34 Correct 174 ms 2736 KB Output is correct
35 Correct 185 ms 2644 KB Output is correct
36 Correct 195 ms 2744 KB Output is correct
37 Correct 353 ms 2744 KB Output is correct
38 Correct 363 ms 2748 KB Output is correct
39 Correct 441 ms 2644 KB Output is correct
40 Correct 484 ms 2744 KB Output is correct
41 Correct 483 ms 2736 KB Output is correct
42 Correct 445 ms 2740 KB Output is correct
43 Correct 439 ms 2868 KB Output is correct
44 Correct 470 ms 2868 KB Output is correct
45 Correct 448 ms 2872 KB Output is correct
46 Correct 487 ms 2764 KB Output is correct
47 Correct 445 ms 2736 KB Output is correct
48 Correct 441 ms 2740 KB Output is correct
49 Correct 455 ms 2740 KB Output is correct
50 Correct 436 ms 2764 KB Output is correct
51 Correct 462 ms 2744 KB Output is correct
52 Correct 485 ms 2868 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2768 KB Output is correct
2 Correct 12 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 9 ms 2644 KB Output is correct
5 Correct 24 ms 2768 KB Output is correct
6 Correct 18 ms 2644 KB Output is correct
7 Correct 12 ms 2644 KB Output is correct
8 Correct 23 ms 2772 KB Output is correct
9 Correct 19 ms 2768 KB Output is correct
10 Correct 71 ms 2644 KB Output is correct
11 Correct 57 ms 2752 KB Output is correct
12 Correct 55 ms 2744 KB Output is correct
13 Correct 47 ms 2644 KB Output is correct
14 Correct 53 ms 2744 KB Output is correct
15 Correct 55 ms 2744 KB Output is correct
16 Correct 72 ms 2744 KB Output is correct
17 Correct 35 ms 2644 KB Output is correct
18 Correct 48 ms 2644 KB Output is correct
19 Correct 49 ms 2740 KB Output is correct
20 Correct 60 ms 2644 KB Output is correct
21 Correct 121 ms 2744 KB Output is correct
22 Correct 136 ms 2740 KB Output is correct
23 Correct 91 ms 2736 KB Output is correct
24 Correct 166 ms 2740 KB Output is correct
25 Correct 188 ms 2740 KB Output is correct
26 Correct 191 ms 2740 KB Output is correct
27 Correct 175 ms 2744 KB Output is correct
28 Correct 180 ms 2740 KB Output is correct
29 Correct 177 ms 2740 KB Output is correct
30 Correct 182 ms 2744 KB Output is correct
31 Correct 177 ms 2764 KB Output is correct
32 Correct 198 ms 2744 KB Output is correct
33 Correct 183 ms 2644 KB Output is correct
34 Correct 174 ms 2736 KB Output is correct
35 Correct 185 ms 2644 KB Output is correct
36 Correct 195 ms 2744 KB Output is correct
37 Correct 353 ms 2744 KB Output is correct
38 Correct 363 ms 2748 KB Output is correct
39 Correct 441 ms 2644 KB Output is correct
40 Correct 484 ms 2744 KB Output is correct
41 Correct 483 ms 2736 KB Output is correct
42 Correct 445 ms 2740 KB Output is correct
43 Correct 439 ms 2868 KB Output is correct
44 Correct 470 ms 2868 KB Output is correct
45 Correct 448 ms 2872 KB Output is correct
46 Correct 487 ms 2764 KB Output is correct
47 Correct 445 ms 2736 KB Output is correct
48 Correct 441 ms 2740 KB Output is correct
49 Correct 455 ms 2740 KB Output is correct
50 Correct 436 ms 2764 KB Output is correct
51 Correct 462 ms 2744 KB Output is correct
52 Correct 485 ms 2868 KB Output is correct
53 Correct 576 ms 2872 KB Output is correct
54 Correct 642 ms 2872 KB Output is correct
55 Correct 617 ms 2996 KB Output is correct
56 Correct 559 ms 2880 KB Output is correct
57 Correct 637 ms 3000 KB Output is correct
58 Correct 606 ms 2868 KB Output is correct
59 Correct 659 ms 2892 KB Output is correct
60 Correct 658 ms 2744 KB Output is correct
61 Correct 626 ms 3000 KB Output is correct
62 Correct 577 ms 3000 KB Output is correct
63 Correct 593 ms 2996 KB Output is correct
64 Correct 573 ms 3004 KB Output is correct
65 Correct 556 ms 2748 KB Output is correct
66 Correct 560 ms 2744 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2768 KB Output is correct
2 Correct 12 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 9 ms 2644 KB Output is correct
5 Correct 24 ms 2768 KB Output is correct
6 Correct 18 ms 2644 KB Output is correct
7 Correct 12 ms 2644 KB Output is correct
8 Correct 23 ms 2772 KB Output is correct
9 Correct 19 ms 2768 KB Output is correct
10 Correct 71 ms 2644 KB Output is correct
11 Correct 57 ms 2752 KB Output is correct
12 Correct 55 ms 2744 KB Output is correct
13 Correct 47 ms 2644 KB Output is correct
14 Correct 53 ms 2744 KB Output is correct
15 Correct 55 ms 2744 KB Output is correct
16 Correct 72 ms 2744 KB Output is correct
17 Correct 35 ms 2644 KB Output is correct
18 Correct 48 ms 2644 KB Output is correct
19 Correct 49 ms 2740 KB Output is correct
20 Correct 60 ms 2644 KB Output is correct
21 Correct 121 ms 2744 KB Output is correct
22 Correct 136 ms 2740 KB Output is correct
23 Correct 91 ms 2736 KB Output is correct
24 Correct 166 ms 2740 KB Output is correct
25 Correct 188 ms 2740 KB Output is correct
26 Correct 191 ms 2740 KB Output is correct
27 Correct 175 ms 2744 KB Output is correct
28 Correct 180 ms 2740 KB Output is correct
29 Correct 177 ms 2740 KB Output is correct
30 Correct 182 ms 2744 KB Output is correct
31 Correct 177 ms 2764 KB Output is correct
32 Correct 198 ms 2744 KB Output is correct
33 Correct 183 ms 2644 KB Output is correct
34 Correct 174 ms 2736 KB Output is correct
35 Correct 185 ms 2644 KB Output is correct
36 Correct 195 ms 2744 KB Output is correct
37 Correct 353 ms 2744 KB Output is correct
38 Correct 363 ms 2748 KB Output is correct
39 Correct 441 ms 2644 KB Output is correct
40 Correct 484 ms 2744 KB Output is correct
41 Correct 483 ms 2736 KB Output is correct
42 Correct 445 ms 2740 KB Output is correct
43 Correct 439 ms 2868 KB Output is correct
44 Correct 470 ms 2868 KB Output is correct
45 Correct 448 ms 2872 KB Output is correct
46 Correct 487 ms 2764 KB Output is correct
47 Correct 445 ms 2736 KB Output is correct
48 Correct 441 ms 2740 KB Output is correct
49 Correct 455 ms 2740 KB Output is correct
50 Correct 436 ms 2764 KB Output is correct
51 Correct 462 ms 2744 KB Output is correct
52 Correct 485 ms 2868 KB Output is correct
53 Correct 576 ms 2872 KB Output is correct
54 Correct 642 ms 2872 KB Output is correct
55 Correct 617 ms 2996 KB Output is correct
56 Correct 559 ms 2880 KB Output is correct
57 Correct 637 ms 3000 KB Output is correct
58 Correct 606 ms 2868 KB Output is correct
59 Correct 659 ms 2892 KB Output is correct
60 Correct 658 ms 2744 KB Output is correct
61 Correct 626 ms 3000 KB Output is correct
62 Correct 577 ms 3000 KB Output is correct
63 Correct 593 ms 2996 KB Output is correct
64 Correct 573 ms 3004 KB Output is correct
65 Correct 556 ms 2748 KB Output is correct
66 Correct 560 ms 2744 KB Output is correct
67 Correct 759 ms 2876 KB Output is correct
68 Correct 289 ms 2760 KB Output is correct
69 Correct 887 ms 3388 KB Output is correct
70 Correct 896 ms 3128 KB Output is correct
71 Correct 917 ms 3128 KB Output is correct
72 Correct 931 ms 2744 KB Output is correct
73 Correct 915 ms 2748 KB Output is correct
74 Correct 905 ms 3408 KB Output is correct
75 Correct 911 ms 3276 KB Output is correct
76 Correct 948 ms 3400 KB Output is correct
77 Correct 920 ms 3388 KB Output is correct