oj.uz

Submission #1112891

# Submission time Handle Problem Language Result Execution time Memory
1112891 2024-11-15T07:55:01 Z adiyer Bootfall (IZhO17_bootfall) C++17
0 / 100
 16 ms 3532 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
 
using namespace std;
 
typedef int ll;
 
const int N = 5e2 + 11;
const int MAX = 1e6;
 
ll n, s;
ll a[N];

bool ok[500 * 500 + 3];

bitset < 500 * 500 > dp;
 
void sol(){
	cin >> n, dp[0] = 1;
	for(ll i = 1; i <= 500 * 500; i++) ok[i] = 1;
	for(ll i = 1; i <= n; i++) cin >> a[i], dp |= (dp << a[i]), s += a[i];
	if(s % 2 || dp[s / 2] == 0){
		cout << "0\n";
		return;
	}
	for(ll i = 1; i <= n; i++){
		dp &= 0, dp[0] = 1; 
		s -= a[i];
		for(ll j = 1; j <= n; j++)
			if(i != j)
				dp |= (dp << a[j]);
		for(ll j = 1; j <= s; j++){
			if(s < j || (s - j) % 2) ok[j] = 0;
			else ok[j] &= dp[(s - j) / 2];	
		}
		s += a[i];
	}
	vector < ll > ans;
	for(ll i = 1; i <= 500 * 500; i++)
		if(ok[i])
			ans.pb(i);
	cout << ans.size() << '\n';
	for(ll x : ans) cout << x << ' ';
}
 
signed main(){
	ios                     
	sol();
// 	slow();
//  stress();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3532 KB Output isn't correct
2 Halted 0 ms 0 KB -