oj.uz

Submission #922889

# Submission time Handle Problem Language Result Execution time Memory
922889 2024-02-06T08:55:09 Z penguin133 Bootfall (IZhO17_bootfall) C++17
0 / 100
 63 ms 16468 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

bitset <501*501*2>dp[505], dp2[505];
int n, A[505];
const int os = 500 * 500;

bool chk(int a, int b){
	if(os - a - b >= 0 && dp[n & 1][os - a - b])return 1;
	if(os - a + b >= 0 && os - a + b <= 2 * os && dp[n & 1][os - a + b])return 1;
	if(os + a - b >= 0 && os + a - b <= 2 * os && dp[n & 1][os + a - b])return 1;
	if(os + a + b <= 2 * os && dp[n & 1][os + a + b])return 1;
	return 0;
}

void solve(){
	cin >> n;
	for(int i = 1; i <= n; i++)cin >> A[i];
	//for(int i = 0; i <= 2 * os; i++)dp[0][i] = 0
	dp[0][os] = dp2[n + 1][os] = 1;
	for(int i = 1; i <= n; i++){
		dp[i] |= (dp[i - 1] >> A[i]);
		dp[i] |= (dp[i - 1] << A[i]);
	}
	for(int i = n; i >= 1; i--){
		dp2[i] |= (dp2[i + 1] >> A[i]);
		dp2[i] |= (dp2[i + 1] << A[i]);
	}
	if(!dp[n][os]){
		cout << 0;
		return;
	}
	set <int> s;
	for(int i = 1; i <= os; i++)s.insert(i);
	for(int i = 1; i <= n; i++){
		bitset <501*501*2> tmp = dp[i - 1], tmp2 = tmp;
		for(int j = 0; j <= 2 * os; j++){
			if(dp2[i + 1][j]){
				if(1)tmp2 |= (tmp >> abs(os - j)), tmp2 |= (tmp << abs(os - j));
			}
		}
		for(int j = 0; j <= os; j++)if(!tmp2[os - j] && !tmp2[os + j])s.erase(j);
	}
	cout << (int)s.size() << '\n';
	for(auto i : s)cout << i << ' ';
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

bootfall.cpp:58:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   58 | main(){
      | ^~~~

Subtask #1
0 / 6.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 35.0

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