Submission #769866

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
769866	2023-06-30T12:02:37 Z	NintsiChkhaidze	Bootfall (IZhO17_bootfall)	C++17	0 / 100	199 ms	412 KB

bootfall

#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;

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

	int l = 1;
	if (a[1]%2 == 0) l = 2;

	++n;
	for (int x = l; x <= sum; x += 2){
		//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])/2;
			bitset <250001> dp;
			dp[0] = 1;
			for (int i = 1; i <= n; i++){
				if (i != j) dp |= (dp << a[i]);
			}

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

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

Subtask #1

0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	4 ms	408 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	10 ms	412 KB	Output is correct
5	Correct	168 ms	388 KB	Output is correct
6	Correct	10 ms	412 KB	Output is correct
7	Correct	7 ms	340 KB	Output is correct
8	Correct	199 ms	340 KB	Output is correct
9	Incorrect	46 ms	388 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	4 ms	408 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	10 ms	412 KB	Output is correct
5	Correct	168 ms	388 KB	Output is correct
6	Correct	10 ms	412 KB	Output is correct
7	Correct	7 ms	340 KB	Output is correct
8	Correct	199 ms	340 KB	Output is correct
9	Incorrect	46 ms	388 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	4 ms	408 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	10 ms	412 KB	Output is correct
5	Correct	168 ms	388 KB	Output is correct
6	Correct	10 ms	412 KB	Output is correct
7	Correct	7 ms	340 KB	Output is correct
8	Correct	199 ms	340 KB	Output is correct
9	Incorrect	46 ms	388 KB	Output isn't correct
10	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	4 ms	408 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	10 ms	412 KB	Output is correct
5	Correct	168 ms	388 KB	Output is correct
6	Correct	10 ms	412 KB	Output is correct
7	Correct	7 ms	340 KB	Output is correct
8	Correct	199 ms	340 KB	Output is correct
9	Incorrect	46 ms	388 KB	Output isn't correct
10	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	4 ms	408 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	10 ms	412 KB	Output is correct
5	Correct	168 ms	388 KB	Output is correct
6	Correct	10 ms	412 KB	Output is correct
7	Correct	7 ms	340 KB	Output is correct
8	Correct	199 ms	340 KB	Output is correct
9	Incorrect	46 ms	388 KB	Output isn't correct
10	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	4 ms	408 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	10 ms	412 KB	Output is correct
5	Correct	168 ms	388 KB	Output is correct
6	Correct	10 ms	412 KB	Output is correct
7	Correct	7 ms	340 KB	Output is correct
8	Correct	199 ms	340 KB	Output is correct
9	Incorrect	46 ms	388 KB	Output isn't correct
10	Halted	0 ms	0 KB	-