제출 #1126839

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

bootfall

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

int n, ans;
int a[501];
int dp[250001];
int cnt[250001];

void calc(int i, int sum) {
	for (int j = 0; j <= sum; j++) {
		int s = max(j + j - sum, 0LL);
		
		dp[j + a[i]] -= dp[j];
		cnt[s] += (dp[j] > 0);
		ans +=  (cnt[s] == n);
	}
	for (int j = sum; j >= 0; j--) dp[j+a[i]] += dp[j];
}

void solve () {
	int sum = 0; cin >> n; dp[0] = 1; cnt[0] = n + 1;

	for (int i = 1; i <= n; i++) {
		cin >> a[i]; for (int j = sum; j >= 0; j--) dp[j+a[i]] += dp[j]; sum += a[i];
	}
	
	for (int i = 1; i <= n; i++) calc(i, sum - a[i]);

	if (sum & 1 || !dp[sum/2]) {cout << 0; return ;}

	cout << ans << '\n';
	for (int i = 1; i <= sum; i++) if (cnt[i] == n) cout << i << ' ';
}
signed main() {IOS solve(); return 0;}

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