oj.uz

답안 #536212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536212 2022-03-12T15:26:24 Z akhan42 Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 2852 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;
using bts = bitset<MX>;


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]);
		}
	}


	bts s;
	s[0] = 1;
	bool odd = true, even = true;
	for(int a: arr) {
		s |= s << a;
		total += a;
		if(a % 2)
			even = false;
		else
			odd = false;
	}

	if(total % 2 || s[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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2388 KB Output is correct
2 Correct 17 ms 2344 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 12 ms 2304 KB Output is correct
5 Correct 32 ms 2324 KB Output is correct
6 Correct 23 ms 2336 KB Output is correct
7 Correct 18 ms 2388 KB Output is correct
8 Correct 33 ms 2324 KB Output is correct
9 Correct 26 ms 1364 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2388 KB Output is correct
2 Correct 17 ms 2344 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 12 ms 2304 KB Output is correct
5 Correct 32 ms 2324 KB Output is correct
6 Correct 23 ms 2336 KB Output is correct
7 Correct 18 ms 2388 KB Output is correct
8 Correct 33 ms 2324 KB Output is correct
9 Correct 26 ms 1364 KB Output is correct
10 Correct 73 ms 2284 KB Output is correct
11 Correct 74 ms 2336 KB Output is correct
12 Correct 75 ms 2324 KB Output is correct
13 Correct 68 ms 1364 KB Output is correct
14 Correct 76 ms 2324 KB Output is correct
15 Correct 75 ms 2328 KB Output is correct
16 Correct 72 ms 2340 KB Output is correct
17 Correct 45 ms 2332 KB Output is correct
18 Correct 61 ms 2348 KB Output is correct
19 Correct 65 ms 2336 KB Output is correct
20 Correct 81 ms 2280 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2388 KB Output is correct
2 Correct 17 ms 2344 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 12 ms 2304 KB Output is correct
5 Correct 32 ms 2324 KB Output is correct
6 Correct 23 ms 2336 KB Output is correct
7 Correct 18 ms 2388 KB Output is correct
8 Correct 33 ms 2324 KB Output is correct
9 Correct 26 ms 1364 KB Output is correct
10 Correct 73 ms 2284 KB Output is correct
11 Correct 74 ms 2336 KB Output is correct
12 Correct 75 ms 2324 KB Output is correct
13 Correct 68 ms 1364 KB Output is correct
14 Correct 76 ms 2324 KB Output is correct
15 Correct 75 ms 2328 KB Output is correct
16 Correct 72 ms 2340 KB Output is correct
17 Correct 45 ms 2332 KB Output is correct
18 Correct 61 ms 2348 KB Output is correct
19 Correct 65 ms 2336 KB Output is correct
20 Correct 81 ms 2280 KB Output is correct
21 Correct 170 ms 2336 KB Output is correct
22 Correct 183 ms 2328 KB Output is correct
23 Correct 129 ms 2328 KB Output is correct
24 Correct 251 ms 2328 KB Output is correct
25 Correct 226 ms 2336 KB Output is correct
26 Correct 249 ms 2336 KB Output is correct
27 Correct 253 ms 2328 KB Output is correct
28 Correct 239 ms 2324 KB Output is correct
29 Correct 256 ms 2340 KB Output is correct
30 Correct 241 ms 1364 KB Output is correct
31 Correct 239 ms 2296 KB Output is correct
32 Correct 260 ms 2332 KB Output is correct
33 Correct 233 ms 2296 KB Output is correct
34 Correct 246 ms 2296 KB Output is correct
35 Correct 256 ms 2320 KB Output is correct
36 Correct 238 ms 2328 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2388 KB Output is correct
2 Correct 17 ms 2344 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 12 ms 2304 KB Output is correct
5 Correct 32 ms 2324 KB Output is correct
6 Correct 23 ms 2336 KB Output is correct
7 Correct 18 ms 2388 KB Output is correct
8 Correct 33 ms 2324 KB Output is correct
9 Correct 26 ms 1364 KB Output is correct
10 Correct 73 ms 2284 KB Output is correct
11 Correct 74 ms 2336 KB Output is correct
12 Correct 75 ms 2324 KB Output is correct
13 Correct 68 ms 1364 KB Output is correct
14 Correct 76 ms 2324 KB Output is correct
15 Correct 75 ms 2328 KB Output is correct
16 Correct 72 ms 2340 KB Output is correct
17 Correct 45 ms 2332 KB Output is correct
18 Correct 61 ms 2348 KB Output is correct
19 Correct 65 ms 2336 KB Output is correct
20 Correct 81 ms 2280 KB Output is correct
21 Correct 170 ms 2336 KB Output is correct
22 Correct 183 ms 2328 KB Output is correct
23 Correct 129 ms 2328 KB Output is correct
24 Correct 251 ms 2328 KB Output is correct
25 Correct 226 ms 2336 KB Output is correct
26 Correct 249 ms 2336 KB Output is correct
27 Correct 253 ms 2328 KB Output is correct
28 Correct 239 ms 2324 KB Output is correct
29 Correct 256 ms 2340 KB Output is correct
30 Correct 241 ms 1364 KB Output is correct
31 Correct 239 ms 2296 KB Output is correct
32 Correct 260 ms 2332 KB Output is correct
33 Correct 233 ms 2296 KB Output is correct
34 Correct 246 ms 2296 KB Output is correct
35 Correct 256 ms 2320 KB Output is correct
36 Correct 238 ms 2328 KB Output is correct
37 Correct 501 ms 2552 KB Output is correct
38 Correct 506 ms 2456 KB Output is correct
39 Correct 582 ms 2380 KB Output is correct
40 Correct 682 ms 2460 KB Output is correct
41 Correct 651 ms 2412 KB Output is correct
42 Correct 637 ms 2456 KB Output is correct
43 Correct 616 ms 2592 KB Output is correct
44 Correct 594 ms 2588 KB Output is correct
45 Correct 612 ms 2600 KB Output is correct
46 Correct 681 ms 2420 KB Output is correct
47 Correct 637 ms 2448 KB Output is correct
48 Correct 620 ms 2580 KB Output is correct
49 Correct 607 ms 2552 KB Output is correct
50 Correct 626 ms 2460 KB Output is correct
51 Correct 612 ms 1364 KB Output is correct
52 Correct 673 ms 2680 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2388 KB Output is correct
2 Correct 17 ms 2344 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 12 ms 2304 KB Output is correct
5 Correct 32 ms 2324 KB Output is correct
6 Correct 23 ms 2336 KB Output is correct
7 Correct 18 ms 2388 KB Output is correct
8 Correct 33 ms 2324 KB Output is correct
9 Correct 26 ms 1364 KB Output is correct
10 Correct 73 ms 2284 KB Output is correct
11 Correct 74 ms 2336 KB Output is correct
12 Correct 75 ms 2324 KB Output is correct
13 Correct 68 ms 1364 KB Output is correct
14 Correct 76 ms 2324 KB Output is correct
15 Correct 75 ms 2328 KB Output is correct
16 Correct 72 ms 2340 KB Output is correct
17 Correct 45 ms 2332 KB Output is correct
18 Correct 61 ms 2348 KB Output is correct
19 Correct 65 ms 2336 KB Output is correct
20 Correct 81 ms 2280 KB Output is correct
21 Correct 170 ms 2336 KB Output is correct
22 Correct 183 ms 2328 KB Output is correct
23 Correct 129 ms 2328 KB Output is correct
24 Correct 251 ms 2328 KB Output is correct
25 Correct 226 ms 2336 KB Output is correct
26 Correct 249 ms 2336 KB Output is correct
27 Correct 253 ms 2328 KB Output is correct
28 Correct 239 ms 2324 KB Output is correct
29 Correct 256 ms 2340 KB Output is correct
30 Correct 241 ms 1364 KB Output is correct
31 Correct 239 ms 2296 KB Output is correct
32 Correct 260 ms 2332 KB Output is correct
33 Correct 233 ms 2296 KB Output is correct
34 Correct 246 ms 2296 KB Output is correct
35 Correct 256 ms 2320 KB Output is correct
36 Correct 238 ms 2328 KB Output is correct
37 Correct 501 ms 2552 KB Output is correct
38 Correct 506 ms 2456 KB Output is correct
39 Correct 582 ms 2380 KB Output is correct
40 Correct 682 ms 2460 KB Output is correct
41 Correct 651 ms 2412 KB Output is correct
42 Correct 637 ms 2456 KB Output is correct
43 Correct 616 ms 2592 KB Output is correct
44 Correct 594 ms 2588 KB Output is correct
45 Correct 612 ms 2600 KB Output is correct
46 Correct 681 ms 2420 KB Output is correct
47 Correct 637 ms 2448 KB Output is correct
48 Correct 620 ms 2580 KB Output is correct
49 Correct 607 ms 2552 KB Output is correct
50 Correct 626 ms 2460 KB Output is correct
51 Correct 612 ms 1364 KB Output is correct
52 Correct 673 ms 2680 KB Output is correct
53 Correct 757 ms 2596 KB Output is correct
54 Correct 888 ms 2584 KB Output is correct
55 Correct 836 ms 2852 KB Output is correct
56 Correct 776 ms 2680 KB Output is correct
57 Correct 848 ms 2836 KB Output is correct
58 Correct 918 ms 2604 KB Output is correct
59 Correct 904 ms 2720 KB Output is correct
60 Correct 851 ms 1364 KB Output is correct
61 Correct 889 ms 2720 KB Output is correct
62 Correct 796 ms 2808 KB Output is correct
63 Correct 787 ms 2840 KB Output is correct
64 Correct 774 ms 2840 KB Output is correct
65 Correct 753 ms 2448 KB Output is correct
66 Correct 750 ms 2456 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2388 KB Output is correct
2 Correct 17 ms 2344 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 12 ms 2304 KB Output is correct
5 Correct 32 ms 2324 KB Output is correct
6 Correct 23 ms 2336 KB Output is correct
7 Correct 18 ms 2388 KB Output is correct
8 Correct 33 ms 2324 KB Output is correct
9 Correct 26 ms 1364 KB Output is correct
10 Correct 73 ms 2284 KB Output is correct
11 Correct 74 ms 2336 KB Output is correct
12 Correct 75 ms 2324 KB Output is correct
13 Correct 68 ms 1364 KB Output is correct
14 Correct 76 ms 2324 KB Output is correct
15 Correct 75 ms 2328 KB Output is correct
16 Correct 72 ms 2340 KB Output is correct
17 Correct 45 ms 2332 KB Output is correct
18 Correct 61 ms 2348 KB Output is correct
19 Correct 65 ms 2336 KB Output is correct
20 Correct 81 ms 2280 KB Output is correct
21 Correct 170 ms 2336 KB Output is correct
22 Correct 183 ms 2328 KB Output is correct
23 Correct 129 ms 2328 KB Output is correct
24 Correct 251 ms 2328 KB Output is correct
25 Correct 226 ms 2336 KB Output is correct
26 Correct 249 ms 2336 KB Output is correct
27 Correct 253 ms 2328 KB Output is correct
28 Correct 239 ms 2324 KB Output is correct
29 Correct 256 ms 2340 KB Output is correct
30 Correct 241 ms 1364 KB Output is correct
31 Correct 239 ms 2296 KB Output is correct
32 Correct 260 ms 2332 KB Output is correct
33 Correct 233 ms 2296 KB Output is correct
34 Correct 246 ms 2296 KB Output is correct
35 Correct 256 ms 2320 KB Output is correct
36 Correct 238 ms 2328 KB Output is correct
37 Correct 501 ms 2552 KB Output is correct
38 Correct 506 ms 2456 KB Output is correct
39 Correct 582 ms 2380 KB Output is correct
40 Correct 682 ms 2460 KB Output is correct
41 Correct 651 ms 2412 KB Output is correct
42 Correct 637 ms 2456 KB Output is correct
43 Correct 616 ms 2592 KB Output is correct
44 Correct 594 ms 2588 KB Output is correct
45 Correct 612 ms 2600 KB Output is correct
46 Correct 681 ms 2420 KB Output is correct
47 Correct 637 ms 2448 KB Output is correct
48 Correct 620 ms 2580 KB Output is correct
49 Correct 607 ms 2552 KB Output is correct
50 Correct 626 ms 2460 KB Output is correct
51 Correct 612 ms 1364 KB Output is correct
52 Correct 673 ms 2680 KB Output is correct
53 Correct 757 ms 2596 KB Output is correct
54 Correct 888 ms 2584 KB Output is correct
55 Correct 836 ms 2852 KB Output is correct
56 Correct 776 ms 2680 KB Output is correct
57 Correct 848 ms 2836 KB Output is correct
58 Correct 918 ms 2604 KB Output is correct
59 Correct 904 ms 2720 KB Output is correct
60 Correct 851 ms 1364 KB Output is correct
61 Correct 889 ms 2720 KB Output is correct
62 Correct 796 ms 2808 KB Output is correct
63 Correct 787 ms 2840 KB Output is correct
64 Correct 774 ms 2840 KB Output is correct
65 Correct 753 ms 2448 KB Output is correct
66 Correct 750 ms 2456 KB Output is correct
67 Execution timed out 1055 ms 2724 KB Time limit exceeded
68 Halted 0 ms 0 KB -