답안 #1009019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1009019 2024-06-27T08:00:26 Z Muaath_5 Bootfall (IZhO17_bootfall) C++17
13 / 100
1000 ms 592 KB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;

const int N = 50000;

int a[N];

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n;
	cin >> n;
	int sum = 0;
	bitset<N> ddp;
	ddp[0] = 1;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		sum += a[i];
		ddp |= (ddp << a[i]);
	}
	if (sum%2 == 1 || !ddp[sum/2]) {
		cout << "0\n";
		return 0;
	}
	vector<int> v;
	for (int i = 1; i <= sum; i++) {
		bool ok = true;
		for (int p = 0; p < n; p++) {
			bitset<N> dp;
			dp[0] = 1;
			int ss = 0;
			for (int j = 0; j < n; j++) {
				if (p == j) continue;
				dp |= (dp << a[j]);
				ss += a[j];
			}
			if ((ss+i)%2 == 1) {
				ok = false;
				break;
			}
			if (!dp[(ss+i)/2]) {
				ok = false;
				break;
			}
		}
		cerr << '\n';
		if (ok) v.push_back(i);
	}
	cout << v.size() << '\n';
	for (int i : v) cout << i << ' ';
}
# 결과 실행 시간 메모리 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 3 ms 480 KB Output is correct
5 Correct 32 ms 464 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 42 ms 492 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
# 결과 실행 시간 메모리 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 3 ms 480 KB Output is correct
5 Correct 32 ms 464 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 42 ms 492 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 28 ms 348 KB Output is correct
11 Correct 101 ms 348 KB Output is correct
12 Correct 15 ms 488 KB Output is correct
13 Correct 12 ms 488 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 72 ms 348 KB Output is correct
16 Correct 105 ms 344 KB Output is correct
17 Correct 26 ms 344 KB Output is correct
18 Correct 58 ms 348 KB Output is correct
19 Correct 53 ms 344 KB Output is correct
20 Correct 28 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 3 ms 480 KB Output is correct
5 Correct 32 ms 464 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 42 ms 492 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 28 ms 348 KB Output is correct
11 Correct 101 ms 348 KB Output is correct
12 Correct 15 ms 488 KB Output is correct
13 Correct 12 ms 488 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 72 ms 348 KB Output is correct
16 Correct 105 ms 344 KB Output is correct
17 Correct 26 ms 344 KB Output is correct
18 Correct 58 ms 348 KB Output is correct
19 Correct 53 ms 344 KB Output is correct
20 Correct 28 ms 344 KB Output is correct
21 Execution timed out 1044 ms 592 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 3 ms 480 KB Output is correct
5 Correct 32 ms 464 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 42 ms 492 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 28 ms 348 KB Output is correct
11 Correct 101 ms 348 KB Output is correct
12 Correct 15 ms 488 KB Output is correct
13 Correct 12 ms 488 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 72 ms 348 KB Output is correct
16 Correct 105 ms 344 KB Output is correct
17 Correct 26 ms 344 KB Output is correct
18 Correct 58 ms 348 KB Output is correct
19 Correct 53 ms 344 KB Output is correct
20 Correct 28 ms 344 KB Output is correct
21 Execution timed out 1044 ms 592 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 3 ms 480 KB Output is correct
5 Correct 32 ms 464 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 42 ms 492 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 28 ms 348 KB Output is correct
11 Correct 101 ms 348 KB Output is correct
12 Correct 15 ms 488 KB Output is correct
13 Correct 12 ms 488 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 72 ms 348 KB Output is correct
16 Correct 105 ms 344 KB Output is correct
17 Correct 26 ms 344 KB Output is correct
18 Correct 58 ms 348 KB Output is correct
19 Correct 53 ms 344 KB Output is correct
20 Correct 28 ms 344 KB Output is correct
21 Execution timed out 1044 ms 592 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 3 ms 480 KB Output is correct
5 Correct 32 ms 464 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 42 ms 492 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 28 ms 348 KB Output is correct
11 Correct 101 ms 348 KB Output is correct
12 Correct 15 ms 488 KB Output is correct
13 Correct 12 ms 488 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 72 ms 348 KB Output is correct
16 Correct 105 ms 344 KB Output is correct
17 Correct 26 ms 344 KB Output is correct
18 Correct 58 ms 348 KB Output is correct
19 Correct 53 ms 344 KB Output is correct
20 Correct 28 ms 344 KB Output is correct
21 Execution timed out 1044 ms 592 KB Time limit exceeded
22 Halted 0 ms 0 KB -