oj.uz

답안 #729661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
729661 2023-04-24T10:33:56 Z yhlas Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 500 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 + 10000)>>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 <= 10000) {
		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++) {
			if ((smv - v[i]) % 2) {
				tr = false;
				break;
			}
			
			for (int j = v[i]; j <= mv; j++) can[j] -= can[j - v[i]];
			
			if (!can[(smv - v[i])>>1]) {
				tr = false;
				break;
			}
			
			for (int j = mv; 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

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 27 ms 320 KB Output is correct
5 Correct 25 ms 360 KB Output is correct
6 Correct 24 ms 356 KB Output is correct
7 Correct 19 ms 364 KB Output is correct
8 Correct 28 ms 340 KB Output is correct
9 Correct 31 ms 344 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 27 ms 320 KB Output is correct
5 Correct 25 ms 360 KB Output is correct
6 Correct 24 ms 356 KB Output is correct
7 Correct 19 ms 364 KB Output is correct
8 Correct 28 ms 340 KB Output is correct
9 Correct 31 ms 344 KB Output is correct
10 Correct 23 ms 340 KB Output is correct
11 Correct 25 ms 340 KB Output is correct
12 Correct 19 ms 360 KB Output is correct
13 Correct 19 ms 340 KB Output is correct
14 Correct 20 ms 368 KB Output is correct
15 Correct 21 ms 340 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 21 ms 344 KB Output is correct
18 Correct 26 ms 340 KB Output is correct
19 Correct 19 ms 340 KB Output is correct
20 Correct 21 ms 316 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 27 ms 320 KB Output is correct
5 Correct 25 ms 360 KB Output is correct
6 Correct 24 ms 356 KB Output is correct
7 Correct 19 ms 364 KB Output is correct
8 Correct 28 ms 340 KB Output is correct
9 Correct 31 ms 344 KB Output is correct
10 Correct 23 ms 340 KB Output is correct
11 Correct 25 ms 340 KB Output is correct
12 Correct 19 ms 360 KB Output is correct
13 Correct 19 ms 340 KB Output is correct
14 Correct 20 ms 368 KB Output is correct
15 Correct 21 ms 340 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 21 ms 344 KB Output is correct
18 Correct 26 ms 340 KB Output is correct
19 Correct 19 ms 340 KB Output is correct
20 Correct 21 ms 316 KB Output is correct
21 Correct 454 ms 384 KB Output is correct
22 Correct 538 ms 364 KB Output is correct
23 Correct 218 ms 360 KB Output is correct
24 Execution timed out 1081 ms 500 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 27 ms 320 KB Output is correct
5 Correct 25 ms 360 KB Output is correct
6 Correct 24 ms 356 KB Output is correct
7 Correct 19 ms 364 KB Output is correct
8 Correct 28 ms 340 KB Output is correct
9 Correct 31 ms 344 KB Output is correct
10 Correct 23 ms 340 KB Output is correct
11 Correct 25 ms 340 KB Output is correct
12 Correct 19 ms 360 KB Output is correct
13 Correct 19 ms 340 KB Output is correct
14 Correct 20 ms 368 KB Output is correct
15 Correct 21 ms 340 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 21 ms 344 KB Output is correct
18 Correct 26 ms 340 KB Output is correct
19 Correct 19 ms 340 KB Output is correct
20 Correct 21 ms 316 KB Output is correct
21 Correct 454 ms 384 KB Output is correct
22 Correct 538 ms 364 KB Output is correct
23 Correct 218 ms 360 KB Output is correct
24 Execution timed out 1081 ms 500 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 27 ms 320 KB Output is correct
5 Correct 25 ms 360 KB Output is correct
6 Correct 24 ms 356 KB Output is correct
7 Correct 19 ms 364 KB Output is correct
8 Correct 28 ms 340 KB Output is correct
9 Correct 31 ms 344 KB Output is correct
10 Correct 23 ms 340 KB Output is correct
11 Correct 25 ms 340 KB Output is correct
12 Correct 19 ms 360 KB Output is correct
13 Correct 19 ms 340 KB Output is correct
14 Correct 20 ms 368 KB Output is correct
15 Correct 21 ms 340 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 21 ms 344 KB Output is correct
18 Correct 26 ms 340 KB Output is correct
19 Correct 19 ms 340 KB Output is correct
20 Correct 21 ms 316 KB Output is correct
21 Correct 454 ms 384 KB Output is correct
22 Correct 538 ms 364 KB Output is correct
23 Correct 218 ms 360 KB Output is correct
24 Execution timed out 1081 ms 500 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 27 ms 320 KB Output is correct
5 Correct 25 ms 360 KB Output is correct
6 Correct 24 ms 356 KB Output is correct
7 Correct 19 ms 364 KB Output is correct
8 Correct 28 ms 340 KB Output is correct
9 Correct 31 ms 344 KB Output is correct
10 Correct 23 ms 340 KB Output is correct
11 Correct 25 ms 340 KB Output is correct
12 Correct 19 ms 360 KB Output is correct
13 Correct 19 ms 340 KB Output is correct
14 Correct 20 ms 368 KB Output is correct
15 Correct 21 ms 340 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 21 ms 344 KB Output is correct
18 Correct 26 ms 340 KB Output is correct
19 Correct 19 ms 340 KB Output is correct
20 Correct 21 ms 316 KB Output is correct
21 Correct 454 ms 384 KB Output is correct
22 Correct 538 ms 364 KB Output is correct
23 Correct 218 ms 360 KB Output is correct
24 Execution timed out 1081 ms 500 KB Time limit exceeded
25 Halted 0 ms 0 KB -