제출 #499361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499361		beksultan04	Bootfall (IZhO17_bootfall)	C++14	13 / 100	1 ms	332 KiB

bootfall

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define pii pair<int,int>
#define ret return
#define fr first
#define sc second
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define nosol puts("-1");
#define pb push_back
#define endi puts("");
#define ordered_set tree <int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N = 2e6+12,INF = 1e18+7;
int q[N],dp[N],sum;

void add(int x){
	for (int i = sum;i>=0;--i)
		if (dp[i] > 0)
			dp[i+x] += dp[i];
}

void del(int x){
	for (int i = 0;i <= sum;++i)
		if (dp[i] > 0)
			dp[i+x] -= dp[i];
}

int cnt[N];

main(){
	int n,i,j;
	cin>>n;
	dp[0]=1;
	for (i=1;i<=n;++i){
		cin>>q[i];
		add(q[i]);
		sum += q[i];
	}
	if (sum&1 || dp[sum/2] == 0){
		cout <<0;
		ret 0;
	}
	
	for (i=1;i<=n;++i){
		del(q[i]);
		sum -= q[i];
		for (j = sum/2+1; j <= sum;++j){
			if (dp[j] > 0 ){
				cnt[j*2-sum]++;
			}
		}
		sum += q[i];
		add(q[i]);
	}
	vector <int> ans;
	for (i=1;i<=sum;++i)
		if (cnt[i] == n)
			ans.pb(i);
		
	
	cout <<ans.size()<<"\n";
	for (auto x:ans)cout <<x<<" ";
	
}

컴파일 시 표준 에러 (stderr) 메시지

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

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