oj.uz

Submission #754284

# Submission time Handle Problem Language Result Execution time Memory
754284 2023-06-07T12:08:59 Z Olympia Bootfall (IZhO17_bootfall) C++17
0 / 100
 1 ms 320 KB 
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <map>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
bool okay (vector<int> v) {
	int sum = 0;
	for (int i: v) {
		sum += i;
	}
	if (sum % 2 == 1) {
		return false;
	}
	bitset<5000> bs;
	bs[0] = true;
	for (int i: v) {
		bs |= (bs << i);
	}
	return bs[sum/2];
}
vector<int> remove (vector<int> v, int ind) {
	vector<int> a;
	for (int i = 0; i < v.size(); i++) {
		if (i != ind) {
			a.push_back(v[i]);
		}
	}
	return a;
}
int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
    	cin >> v[i];
    }
    vector<int> ans;
    for (int i = 0; i <= 500; i++) {
    	v.push_back(i);
    	bool fine = true;
    	for (int j = 0; j < v.size(); j++) {
    		if (!okay(remove(v, j))) {
    			fine = false;
    			break;
    		}
    	}
    	if (fine) {
    		ans.push_back(i);
    	}
    	v.pop_back();
    }
    cout << ans.size() << endl;
    for (int i: ans) {
    	cout << i << ' ';
    }
    cout << endl;
}

Compilation message

bootfall.cpp: In function 'std::vector<int> remove(std::vector<int>, int)':
bootfall.cpp:27:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
bootfall.cpp: In function 'int main()':
bootfall.cpp:47:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |      for (int j = 0; j < v.size(); j++) {
      |                      ~~^~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 KB Output isn't correct
5 Halted 0 ms 0 KB -