oj.uz

Submission #1100975

# Submission time Handle Problem Language Result Execution time Memory
1100975 2024-10-15T06:53:21 Z Muhammet Bootfall (IZhO17_bootfall) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(s) (int)s.size()
#define ll long long
#define ff first
#define ss second

const int N = 2e3 + 5;
const ll M = 1e9+7;

int n, a[N];

int main(){
	cin >> n;
	int mx = 0;
	ll s = 0;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		s += a[i];
		mx = max(a[i],mx);
	}
	vector <vector<int>> dp(n+1, vector <int> (mx*n+1,0));
	vector <int> v;
	for(int i = 1; i <= n; i++){
		v.clear();
		for(int j = 1; j <= n; j++){
			if(j == i) continue;
			v.push_back(a[j]);
		}
		dp[i][0] = 1;
		for(int j = 0; j < sz(v); j++){
			for(int k = min((ll)500,s)-v[j]; k >= 0; k--){
				if(dp[i][k] == 1) dp[i][k+v[j]] = 1;
			}
		}
	}
	if(!dp[1][s/2] or s % 2 == 1){
		cout << 0;
		return 0;
	}
	v.clear();
	for(int i = (a[1] % 2 == 0 ? 2 : 1); i <= n*mx; i += 2){
		bool tr = 0;
		for(int j = 1; j <= n; j++){
			ll x = s-a[j]+i;
			if(!dp[j][x/2] or x % 2 == 1){
				tr = 1;
				break;
			}
		}
		if(tr == 0) v.push_back(i);
	}
	cout << sz(v) << '\n';
	for(int i : v){
		cout << i << ' ';
	}
	return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -