oj.uz

Submission #729681

# Submission time Handle Problem Language Result Execution time Memory
729681 2023-04-24T10:59:42 Z yhlas Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 464 KB 
#include "bits/stdc++.h"
using namespace std;

int32_t main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n;
	cin >> n;
	vector <int> a(n + 1, 0);
	int sm = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		sm += a[i];
	}
	
	if (sm % 2) return cout << 0, 0;
	
	int m = (sm + min(sm, 5000))>>1;

	vector <int> dp(m + 1, 0);
	dp[0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = m - a[i]; j >= 0; j--) dp[j + a[i]] += dp[j];
	}

	if (!dp[sm>>1]) return cout << 0, 0;

	vector <int> ans;
	int x = 0;
	while (++x <= min(sm, 5000)) {
		int smv = sm + x;
		int mv = smv>>1;
		
		vector <int> v = a; v.push_back(x);
		
		vector <int> can = dp;
		for (int i = mv; i >= x; i--) can[i] += can[i - x];
			
		bool tr = true;
		for (int i = 1; i <= n + 1; i++) {
			int x = smv - v[i];
			if (x % 2) {
				tr = false;
				break;
			}
			
			x >>= 1;
			
			for (int j = v[i]; j <= x; j++) can[j] -= can[j - v[i]];
			
			if (!can[x]) {
				tr = false;
				break;
			}
			
			for (int j = x; j >= v[i]; j--) can[j] += can[j - v[i]];
		}
		
		if (tr) ans.push_back(x);
	}
	
	cout << (int)ans.size() << '\n';
	for (auto i : ans) cout << i << ' ';
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 2 ms 244 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 368 ms 352 KB Output is correct
22 Correct 484 ms 460 KB Output is correct
23 Correct 156 ms 320 KB Output is correct
24 Execution timed out 1090 ms 464 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 2 ms 244 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 368 ms 352 KB Output is correct
22 Correct 484 ms 460 KB Output is correct
23 Correct 156 ms 320 KB Output is correct
24 Execution timed out 1090 ms 464 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 2 ms 244 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 368 ms 352 KB Output is correct
22 Correct 484 ms 460 KB Output is correct
23 Correct 156 ms 320 KB Output is correct
24 Execution timed out 1090 ms 464 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 2 ms 244 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 368 ms 352 KB Output is correct
22 Correct 484 ms 460 KB Output is correct
23 Correct 156 ms 320 KB Output is correct
24 Execution timed out 1090 ms 464 KB Time limit exceeded
25 Halted 0 ms 0 KB -