Submission #36157

#	Time	Username	Problem	Language	Result	Execution time	Memory
36157		ToMoClone	Bootfall (IZhO17_bootfall)	C++14	28 / 100	1000 ms	6200 KiB

bootfall

/*input
4
1 3 1 5
*/
#include <stdio.h>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;

const int N = 501;
int check[N * N], cnt[1000001], Lol[501], a[N], n, sum;

void add(int &x, int b){ x = (x + b) % 1000696969; }
void sub(int &x, int b){
	x = (x - b) % 1000696969;
	x = (x >= 0) ? x : x + 1000696969;
}

int main(){
	scanf("%d", &n);

	check[0] = 1;
	for(int i = 1; i <= n; ++i){
		scanf("%d", &a[i]), sum += a[i];
		for(int j = sum; j >= a[i]; --j)
			add(check[j], check[j - a[i]]);

		if(cnt[a[i]] == 1) Lol[i] = 1;
			else ++cnt[a[i]];
	}
	if((sum & 1) || check[sum >> 1] == 0) return puts("0"), 0;

	vector<int> ans;
	for(int i = 1; i <= sum; ++i){
		int Sum = sum + i, ok = 1;
		for(int j = 1; j <= n; ++j){
			if(Lol[j]) continue;

			if(((Sum - a[j]) & 1) || (((Sum - a[j]) >> 1) < i)) {
				ok = 0; break; 
			}

			int Cur = (Sum - a[j]) >> 1;
			for(int k = (Cur - i) % a[j]; k < Cur - i; k += a[j])
				sub(check[k + a[j]], check[k]);

			if(check[Cur - i] == 0) ok = 0;
			for(int k = Cur - i; k > 0; k -= a[j])
				add(check[k], check[k - a[j]]);
		}
		if(ok) ans.push_back(i);
	}

	printf("%d\n", (int)ans.size());
	if(ans.size()) for(int i = 0; i < (int)ans.size(); ++i) printf("%d ", ans[i]);;
	printf("\n");
}

Compilation message (stderr)

bootfall.cpp: In function 'int main()':
bootfall.cpp:20:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
bootfall.cpp:24:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]), sum += a[i];
                                  ^

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