oj.uz

Submission #769873

# Submission time Handle Problem Language Result Execution time Memory
769873 2023-06-30T12:18:46 Z NintsiChkhaidze Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 416 KB 
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define pii pair <int,ll>
#define left (h<<1),l,((l + r)>>1)
#define right ((h<<1)|1),((l + r)>>1) + 1,r
using namespace std;

int sum,a[505];
vector <int> ans;
bitset <250001> dp;
int DP[250005];

signed main() {
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	int n;
	cin>>n;

	for (int i = 1; i <= n; i++)
		cin>>a[i],sum += a[i];

	DP[0] = 1;
	for (int i = 1; i <= n; i++){
		for (int j = sum - a[i]; j >= 0; j--)	
			DP[j + a[i]] |= DP[j];
	}

	if (sum & 1 || !DP[sum/2]){
		cout<<0;
		exit(0);
	}
	++n;
	for (int x = 1; x <= sum; x++){
		//x-s vamatebt axla
		a[n] = x;
		
		int can = 1;
		for (int j = 1; j <= n; j++){
			//j amovagdot
			int target = (sum + x - a[j]);
			if (target&1){
				can=0;
				break;
			}
			target/=2;
			dp = 0;
			dp[0] = 1;
			for (int i = 1; i <= n; i++){
				if (i != j) dp |= (dp << a[i]);
				if (dp[target]) break;
			}

			if (!dp[target]) {
				can = 0;
				break;
			}
		}
		if (can){
			ans.pb(x);
		}
	}

	cout<<ans.size()<<endl;
	for (int x: ans) 
		cout<<x<<" ";
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 151 ms 340 KB Output is correct
6 Correct 9 ms 408 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 196 ms 400 KB Output is correct
9 Correct 16 ms 412 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 151 ms 340 KB Output is correct
6 Correct 9 ms 408 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 196 ms 400 KB Output is correct
9 Correct 16 ms 412 KB Output is correct
10 Correct 114 ms 340 KB Output is correct
11 Correct 468 ms 392 KB Output is correct
12 Correct 49 ms 388 KB Output is correct
13 Correct 29 ms 408 KB Output is correct
14 Correct 496 ms 400 KB Output is correct
15 Correct 400 ms 396 KB Output is correct
16 Correct 552 ms 392 KB Output is correct
17 Correct 132 ms 340 KB Output is correct
18 Correct 327 ms 392 KB Output is correct
19 Correct 277 ms 404 KB Output is correct
20 Correct 148 ms 340 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 151 ms 340 KB Output is correct
6 Correct 9 ms 408 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 196 ms 400 KB Output is correct
9 Correct 16 ms 412 KB Output is correct
10 Correct 114 ms 340 KB Output is correct
11 Correct 468 ms 392 KB Output is correct
12 Correct 49 ms 388 KB Output is correct
13 Correct 29 ms 408 KB Output is correct
14 Correct 496 ms 400 KB Output is correct
15 Correct 400 ms 396 KB Output is correct
16 Correct 552 ms 392 KB Output is correct
17 Correct 132 ms 340 KB Output is correct
18 Correct 327 ms 392 KB Output is correct
19 Correct 277 ms 404 KB Output is correct
20 Correct 148 ms 340 KB Output is correct
21 Execution timed out 1071 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 151 ms 340 KB Output is correct
6 Correct 9 ms 408 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 196 ms 400 KB Output is correct
9 Correct 16 ms 412 KB Output is correct
10 Correct 114 ms 340 KB Output is correct
11 Correct 468 ms 392 KB Output is correct
12 Correct 49 ms 388 KB Output is correct
13 Correct 29 ms 408 KB Output is correct
14 Correct 496 ms 400 KB Output is correct
15 Correct 400 ms 396 KB Output is correct
16 Correct 552 ms 392 KB Output is correct
17 Correct 132 ms 340 KB Output is correct
18 Correct 327 ms 392 KB Output is correct
19 Correct 277 ms 404 KB Output is correct
20 Correct 148 ms 340 KB Output is correct
21 Execution timed out 1071 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 151 ms 340 KB Output is correct
6 Correct 9 ms 408 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 196 ms 400 KB Output is correct
9 Correct 16 ms 412 KB Output is correct
10 Correct 114 ms 340 KB Output is correct
11 Correct 468 ms 392 KB Output is correct
12 Correct 49 ms 388 KB Output is correct
13 Correct 29 ms 408 KB Output is correct
14 Correct 496 ms 400 KB Output is correct
15 Correct 400 ms 396 KB Output is correct
16 Correct 552 ms 392 KB Output is correct
17 Correct 132 ms 340 KB Output is correct
18 Correct 327 ms 392 KB Output is correct
19 Correct 277 ms 404 KB Output is correct
20 Correct 148 ms 340 KB Output is correct
21 Execution timed out 1071 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 151 ms 340 KB Output is correct
6 Correct 9 ms 408 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 196 ms 400 KB Output is correct
9 Correct 16 ms 412 KB Output is correct
10 Correct 114 ms 340 KB Output is correct
11 Correct 468 ms 392 KB Output is correct
12 Correct 49 ms 388 KB Output is correct
13 Correct 29 ms 408 KB Output is correct
14 Correct 496 ms 400 KB Output is correct
15 Correct 400 ms 396 KB Output is correct
16 Correct 552 ms 392 KB Output is correct
17 Correct 132 ms 340 KB Output is correct
18 Correct 327 ms 392 KB Output is correct
19 Correct 277 ms 404 KB Output is correct
20 Correct 148 ms 340 KB Output is correct
21 Execution timed out 1071 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -