oj.uz

Submission #536214

# Submission time Handle Problem Language Result Execution time Memory
536214 2022-03-12T15:29:07 Z akhan42 Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 2760 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define F first
#define S second
#define forn(i, n) for(int i = 0; i < n; ++i)
#define forbn(i, b, n) for(int i = b; i < n; ++i)
#define sz(v) (int)v.size()
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define lc v << 1
#define rc (v << 1) + 1

typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long ll;
typedef complex<double> cd;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

template <class T> inline void mineq(T &a, T b) { a = min(a, b); }
template <class T> inline void maxeq(T &a, T b) { a = max(a, b); }


const int BASE = 500;
const int MX = BASE * BASE + 1;


int mod = 433494437;
int total = 0;


int add(int a, int b) {
	return ((a + b) % mod + mod) % mod;
}


int ct[MX];


void divide(vi pol2, int d, int sh) {

	for(int i = total; i - d >= 0 && i - d + sh >= total / 2; i--) {
		if(pol2[i] != 0) {
			pol2[i - d] = add(pol2[i - d], -pol2[i]);
			ct[i - d + sh] += 1;
		}
	}
}


void solve() {
	int n;
	cin >> n;
	vi arr(n);
	set<int> nums;
	forn(i, n) {
		cin >> arr[i];
		nums.insert(arr[i]);
	}
	sort(all(arr));

	vi pol2(MX, 0);
	pol2[0] = 1;
	for(int a: arr) {
		for(int i = MX - a - 1; i >= 0; i--) {
			pol2[i + a] = add(pol2[i + a], pol2[i]);
		}
	}


	bool odd = true, even = true;
	for(int a: arr) {
		total += a;
		if(a % 2)
			even = false;
		else
			odd = false;
	}

	if(total % 2 || pol2[total / 2] == 0 || (!even && !odd))
	{
		cout << 0;
		return;
	}


	int tt = sz(nums);

	for(int a: nums) {
		int d = (a + (odd ? 1 : 0)) / 2;
		divide(pol2, a, d);
	}

	vi vans;
	int rem = (odd ? 1 : 0) + total;
	forbn(i, (rem + 1) / 2, MX) {
		if(ct[i] == tt) {
			vans.pb(2 * i - rem);
		}
	}

	cout << sz(vans) << '\n';
	for(int el: vans)
		cout << el << ' ';
}


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

//	freopen("triangles.in", "r", stdin);
//	freopen("triangles.out", "w", stdout);

	int t = 1;
//	cin >> t;
	while(t--) {
		solve();
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2260 KB Output is correct
2 Correct 17 ms 2288 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 11 ms 2244 KB Output is correct
5 Correct 34 ms 2256 KB Output is correct
6 Correct 23 ms 2260 KB Output is correct
7 Correct 18 ms 2252 KB Output is correct
8 Correct 33 ms 2252 KB Output is correct
9 Correct 24 ms 1236 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2260 KB Output is correct
2 Correct 17 ms 2288 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 11 ms 2244 KB Output is correct
5 Correct 34 ms 2256 KB Output is correct
6 Correct 23 ms 2260 KB Output is correct
7 Correct 18 ms 2252 KB Output is correct
8 Correct 33 ms 2252 KB Output is correct
9 Correct 24 ms 1236 KB Output is correct
10 Correct 72 ms 2196 KB Output is correct
11 Correct 74 ms 2232 KB Output is correct
12 Correct 81 ms 2252 KB Output is correct
13 Correct 69 ms 1236 KB Output is correct
14 Correct 68 ms 2248 KB Output is correct
15 Correct 67 ms 2236 KB Output is correct
16 Correct 74 ms 2244 KB Output is correct
17 Correct 47 ms 2256 KB Output is correct
18 Correct 64 ms 2244 KB Output is correct
19 Correct 65 ms 2252 KB Output is correct
20 Correct 74 ms 2192 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2260 KB Output is correct
2 Correct 17 ms 2288 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 11 ms 2244 KB Output is correct
5 Correct 34 ms 2256 KB Output is correct
6 Correct 23 ms 2260 KB Output is correct
7 Correct 18 ms 2252 KB Output is correct
8 Correct 33 ms 2252 KB Output is correct
9 Correct 24 ms 1236 KB Output is correct
10 Correct 72 ms 2196 KB Output is correct
11 Correct 74 ms 2232 KB Output is correct
12 Correct 81 ms 2252 KB Output is correct
13 Correct 69 ms 1236 KB Output is correct
14 Correct 68 ms 2248 KB Output is correct
15 Correct 67 ms 2236 KB Output is correct
16 Correct 74 ms 2244 KB Output is correct
17 Correct 47 ms 2256 KB Output is correct
18 Correct 64 ms 2244 KB Output is correct
19 Correct 65 ms 2252 KB Output is correct
20 Correct 74 ms 2192 KB Output is correct
21 Correct 159 ms 2240 KB Output is correct
22 Correct 196 ms 2224 KB Output is correct
23 Correct 123 ms 2248 KB Output is correct
24 Correct 228 ms 2244 KB Output is correct
25 Correct 248 ms 2296 KB Output is correct
26 Correct 235 ms 2236 KB Output is correct
27 Correct 249 ms 2296 KB Output is correct
28 Correct 247 ms 2296 KB Output is correct
29 Correct 240 ms 2232 KB Output is correct
30 Correct 255 ms 1236 KB Output is correct
31 Correct 239 ms 2248 KB Output is correct
32 Correct 242 ms 2244 KB Output is correct
33 Correct 263 ms 2252 KB Output is correct
34 Correct 235 ms 2196 KB Output is correct
35 Correct 239 ms 2236 KB Output is correct
36 Correct 267 ms 2248 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2260 KB Output is correct
2 Correct 17 ms 2288 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 11 ms 2244 KB Output is correct
5 Correct 34 ms 2256 KB Output is correct
6 Correct 23 ms 2260 KB Output is correct
7 Correct 18 ms 2252 KB Output is correct
8 Correct 33 ms 2252 KB Output is correct
9 Correct 24 ms 1236 KB Output is correct
10 Correct 72 ms 2196 KB Output is correct
11 Correct 74 ms 2232 KB Output is correct
12 Correct 81 ms 2252 KB Output is correct
13 Correct 69 ms 1236 KB Output is correct
14 Correct 68 ms 2248 KB Output is correct
15 Correct 67 ms 2236 KB Output is correct
16 Correct 74 ms 2244 KB Output is correct
17 Correct 47 ms 2256 KB Output is correct
18 Correct 64 ms 2244 KB Output is correct
19 Correct 65 ms 2252 KB Output is correct
20 Correct 74 ms 2192 KB Output is correct
21 Correct 159 ms 2240 KB Output is correct
22 Correct 196 ms 2224 KB Output is correct
23 Correct 123 ms 2248 KB Output is correct
24 Correct 228 ms 2244 KB Output is correct
25 Correct 248 ms 2296 KB Output is correct
26 Correct 235 ms 2236 KB Output is correct
27 Correct 249 ms 2296 KB Output is correct
28 Correct 247 ms 2296 KB Output is correct
29 Correct 240 ms 2232 KB Output is correct
30 Correct 255 ms 1236 KB Output is correct
31 Correct 239 ms 2248 KB Output is correct
32 Correct 242 ms 2244 KB Output is correct
33 Correct 263 ms 2252 KB Output is correct
34 Correct 235 ms 2196 KB Output is correct
35 Correct 239 ms 2236 KB Output is correct
36 Correct 267 ms 2248 KB Output is correct
37 Correct 483 ms 2372 KB Output is correct
38 Correct 502 ms 2368 KB Output is correct
39 Correct 626 ms 2324 KB Output is correct
40 Correct 680 ms 2388 KB Output is correct
41 Correct 637 ms 2324 KB Output is correct
42 Correct 631 ms 2368 KB Output is correct
43 Correct 616 ms 2500 KB Output is correct
44 Correct 617 ms 2500 KB Output is correct
45 Correct 626 ms 2496 KB Output is correct
46 Correct 647 ms 2328 KB Output is correct
47 Correct 629 ms 2368 KB Output is correct
48 Correct 598 ms 2496 KB Output is correct
49 Correct 615 ms 2424 KB Output is correct
50 Correct 639 ms 2424 KB Output is correct
51 Correct 600 ms 1236 KB Output is correct
52 Correct 645 ms 2504 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2260 KB Output is correct
2 Correct 17 ms 2288 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 11 ms 2244 KB Output is correct
5 Correct 34 ms 2256 KB Output is correct
6 Correct 23 ms 2260 KB Output is correct
7 Correct 18 ms 2252 KB Output is correct
8 Correct 33 ms 2252 KB Output is correct
9 Correct 24 ms 1236 KB Output is correct
10 Correct 72 ms 2196 KB Output is correct
11 Correct 74 ms 2232 KB Output is correct
12 Correct 81 ms 2252 KB Output is correct
13 Correct 69 ms 1236 KB Output is correct
14 Correct 68 ms 2248 KB Output is correct
15 Correct 67 ms 2236 KB Output is correct
16 Correct 74 ms 2244 KB Output is correct
17 Correct 47 ms 2256 KB Output is correct
18 Correct 64 ms 2244 KB Output is correct
19 Correct 65 ms 2252 KB Output is correct
20 Correct 74 ms 2192 KB Output is correct
21 Correct 159 ms 2240 KB Output is correct
22 Correct 196 ms 2224 KB Output is correct
23 Correct 123 ms 2248 KB Output is correct
24 Correct 228 ms 2244 KB Output is correct
25 Correct 248 ms 2296 KB Output is correct
26 Correct 235 ms 2236 KB Output is correct
27 Correct 249 ms 2296 KB Output is correct
28 Correct 247 ms 2296 KB Output is correct
29 Correct 240 ms 2232 KB Output is correct
30 Correct 255 ms 1236 KB Output is correct
31 Correct 239 ms 2248 KB Output is correct
32 Correct 242 ms 2244 KB Output is correct
33 Correct 263 ms 2252 KB Output is correct
34 Correct 235 ms 2196 KB Output is correct
35 Correct 239 ms 2236 KB Output is correct
36 Correct 267 ms 2248 KB Output is correct
37 Correct 483 ms 2372 KB Output is correct
38 Correct 502 ms 2368 KB Output is correct
39 Correct 626 ms 2324 KB Output is correct
40 Correct 680 ms 2388 KB Output is correct
41 Correct 637 ms 2324 KB Output is correct
42 Correct 631 ms 2368 KB Output is correct
43 Correct 616 ms 2500 KB Output is correct
44 Correct 617 ms 2500 KB Output is correct
45 Correct 626 ms 2496 KB Output is correct
46 Correct 647 ms 2328 KB Output is correct
47 Correct 629 ms 2368 KB Output is correct
48 Correct 598 ms 2496 KB Output is correct
49 Correct 615 ms 2424 KB Output is correct
50 Correct 639 ms 2424 KB Output is correct
51 Correct 600 ms 1236 KB Output is correct
52 Correct 645 ms 2504 KB Output is correct
53 Correct 769 ms 2504 KB Output is correct
54 Correct 907 ms 2496 KB Output is correct
55 Correct 860 ms 2756 KB Output is correct
56 Correct 777 ms 2500 KB Output is correct
57 Correct 865 ms 2760 KB Output is correct
58 Correct 908 ms 2532 KB Output is correct
59 Correct 891 ms 2620 KB Output is correct
60 Correct 849 ms 1236 KB Output is correct
61 Correct 891 ms 2588 KB Output is correct
62 Correct 824 ms 2720 KB Output is correct
63 Correct 801 ms 2756 KB Output is correct
64 Correct 792 ms 2760 KB Output is correct
65 Correct 774 ms 2368 KB Output is correct
66 Correct 759 ms 2372 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2260 KB Output is correct
2 Correct 17 ms 2288 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 11 ms 2244 KB Output is correct
5 Correct 34 ms 2256 KB Output is correct
6 Correct 23 ms 2260 KB Output is correct
7 Correct 18 ms 2252 KB Output is correct
8 Correct 33 ms 2252 KB Output is correct
9 Correct 24 ms 1236 KB Output is correct
10 Correct 72 ms 2196 KB Output is correct
11 Correct 74 ms 2232 KB Output is correct
12 Correct 81 ms 2252 KB Output is correct
13 Correct 69 ms 1236 KB Output is correct
14 Correct 68 ms 2248 KB Output is correct
15 Correct 67 ms 2236 KB Output is correct
16 Correct 74 ms 2244 KB Output is correct
17 Correct 47 ms 2256 KB Output is correct
18 Correct 64 ms 2244 KB Output is correct
19 Correct 65 ms 2252 KB Output is correct
20 Correct 74 ms 2192 KB Output is correct
21 Correct 159 ms 2240 KB Output is correct
22 Correct 196 ms 2224 KB Output is correct
23 Correct 123 ms 2248 KB Output is correct
24 Correct 228 ms 2244 KB Output is correct
25 Correct 248 ms 2296 KB Output is correct
26 Correct 235 ms 2236 KB Output is correct
27 Correct 249 ms 2296 KB Output is correct
28 Correct 247 ms 2296 KB Output is correct
29 Correct 240 ms 2232 KB Output is correct
30 Correct 255 ms 1236 KB Output is correct
31 Correct 239 ms 2248 KB Output is correct
32 Correct 242 ms 2244 KB Output is correct
33 Correct 263 ms 2252 KB Output is correct
34 Correct 235 ms 2196 KB Output is correct
35 Correct 239 ms 2236 KB Output is correct
36 Correct 267 ms 2248 KB Output is correct
37 Correct 483 ms 2372 KB Output is correct
38 Correct 502 ms 2368 KB Output is correct
39 Correct 626 ms 2324 KB Output is correct
40 Correct 680 ms 2388 KB Output is correct
41 Correct 637 ms 2324 KB Output is correct
42 Correct 631 ms 2368 KB Output is correct
43 Correct 616 ms 2500 KB Output is correct
44 Correct 617 ms 2500 KB Output is correct
45 Correct 626 ms 2496 KB Output is correct
46 Correct 647 ms 2328 KB Output is correct
47 Correct 629 ms 2368 KB Output is correct
48 Correct 598 ms 2496 KB Output is correct
49 Correct 615 ms 2424 KB Output is correct
50 Correct 639 ms 2424 KB Output is correct
51 Correct 600 ms 1236 KB Output is correct
52 Correct 645 ms 2504 KB Output is correct
53 Correct 769 ms 2504 KB Output is correct
54 Correct 907 ms 2496 KB Output is correct
55 Correct 860 ms 2756 KB Output is correct
56 Correct 777 ms 2500 KB Output is correct
57 Correct 865 ms 2760 KB Output is correct
58 Correct 908 ms 2532 KB Output is correct
59 Correct 891 ms 2620 KB Output is correct
60 Correct 849 ms 1236 KB Output is correct
61 Correct 891 ms 2588 KB Output is correct
62 Correct 824 ms 2720 KB Output is correct
63 Correct 801 ms 2756 KB Output is correct
64 Correct 792 ms 2760 KB Output is correct
65 Correct 774 ms 2368 KB Output is correct
66 Correct 759 ms 2372 KB Output is correct
67 Execution timed out 1078 ms 2640 KB Time limit exceeded
68 Halted 0 ms 0 KB -