제출 #36163

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36163		ToMoClone	Bootfall (IZhO17_bootfall)	C++14	44 / 100	1000 ms	6524 KiB

bootfall

/*input
4
1 3 1 5
*/
#include <stdio.h>
#include <vector>
using namespace std;

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

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

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

			int A = 0, sign = 1;
			for(int k = ((Sum - a[j]) >> 1) - i; k >= 0; k -= a[j])
				if(sign) add(A, check[k]), sign ^= 1;
					else sub(A, check[k]), sign ^= 1;
			if(A == 0 || A == Mod) ok = 0;
		}
		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");
}

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

bootfall.cpp: In function 'int main()':
bootfall.cpp:22:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
bootfall.cpp:26: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: 16 / 16
• Subtask 5: 0 / 21
• Subtask 6: 0 / 35