제출 #1130660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1130660		zhasyn	Bootfall (IZhO17_bootfall)	C++20	0 / 100	1 ms	328 KiB

bootfall

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 1e5 + 100, M = 500 + 10, len = 315, inf = 1e18;
const ll mod = 998244353;
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll bp(ll x, ll step){
	ll res = 1;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
ll inv(ll x){
	return bp(x, mod - 2);
}
bool block[N], need[N];
int a[N], n, sm, sum;
void get(){
	bitset <73000> b;
	b[0] = 1;
	for(int i = 1; i <= n; i++){
		if(block[i]) continue;
		b |= (b<<a[i]);
	}
	for(int i = 0; i * 2 <= sum; i++){
		if(block[1]) need[sum - i - i] = b[i];
		else need[sum - 2 * i] &= b[i];
		
		//cout << sum - i - i << " " << need[sum - 2 * i] << endl;
	}
	for(int i = sum + 1; i < 73000; i++){
		need[i] = false;
	}
	//cout << endl;
}
int main() {
	//ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		sm += a[i];
	}
	bitset <73000> cc;
	cc[0] = 1;
	for(int i = 1; i <= n; i++){
		cc |= (cc<<a[i]);
	}
	if(sm % 2 == 1 || cc[sm/2] == false){
		cout << 0;
		return 0;
	}
	
	for(int i = 1; i <= n; i++){
		block[i] = true;
		sum = sm - a[i];
		get();
		block[i] = false;
	}
	
	vector <int> vec;
	for(int i = 0; i < 73000; i++){
		if(need[i]) vec.pb(i);
	}
	cout << vec.size() << endl;
	for(auto u : vec){
		cout << u << " ";
	}
  return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 21
• Subtask 6: 0 / 35