oj.uz

Submission #314972

# Submission time Handle Problem Language Result Execution time Memory
314972 2020-10-21T18:22:40 Z shrek12357 Bootfall (IZhO17_bootfall) C++14
0 / 100
 3 ms 384 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0); 

int main() {
	int n;
	cin >> n;
	vector<int> nums;
	bitset<250001> ans;
	ans.flip();
	int sum = 0;
	for (int i = 0; i < n; i++) {
		int temp;
		cin >> temp;
		sum += temp;
		nums.push_back(temp);
	}
	for (int i = 0; i < n; i++) {
		bitset<250001> dp;
		dp[0] = 1;
		for (int j = 0; j < n; j++) {
			if (i == j) {
				continue;
			}
			dp |= (dp << nums[j]);
		}
		bitset<250001> check;
		int curSum = sum - nums[i];
		for (int j = 1; j < 250001; j++) {
			if (dp[j] == 1) {
				int l = j;
				int r = curSum - j;
				if (r == 0) {
					continue;
				}
				check[abs(r - l)] = 1;
			}
		}
		ans &= check;
	}
	ans[0] = 0;
	cout << ans.count() << endl;
	for (int i = 1; i < 250000; i++) {
		if (ans[i] == 1) {
			cout << i << endl;
		}
	}
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 35.0

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