제출 #930698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
930698		allin27x	Bootfall (IZhO17_bootfall)	C++17	28 / 100	1046 ms	8280 KiB

bootfall

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 502;

set<int> good;
set<int> ng;
set<int> nng;

int ar[MAXN];
int n;
bitset<MAXN * MAXN> kp;

void knap(int ind){
	kp.reset();
	kp.set(0);
	int s =0; for (int i=0; i<n; i++) if (i!= ind) s+=ar[i];
	for (int i=0; i<n; i++){
		if (i==ind) continue;
		kp |= kp<<ar[i];
	}
	ng.clear();
	for (int i=1; i<n*MAXN; i++){
		if (!kp[i]) continue;
		// i  = (s-i) + r
		if (2*i-s <= 0) continue;
		ng.insert(2*i-s);
	}
	nng.clear();
	for (int x: good) if (ng.count(x)) nng.insert(x);
	good = nng; 
}
int main(){
	cin>>n;
	for (int i=0; i<n; i++) cin>>ar[i];
	for (int i=1; i<n*MAXN; i++) good.insert(i);
	if (n&1) {cout<<0; exit(0);}
	int s=0; for (int i=0; i<n; i++) s += ar[i];
	kp.set(0);
	for (int i=0; i<n; i++){
		kp |= kp << ar[i];
	}
	if (!kp[s/2])  {cout<<0; exit(0);}
	for (int i=0; i<n; i++){
		knap(i);
	}
	cout<<good.size()<<'\n';
	for (int x: good) cout<<x<<' ';
}

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