답안 #36157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36157 2017-12-06T05:12:37 Z ToMoClone Bootfall (IZhO17_bootfall) C++14
28 / 100
1000 ms 6200 KB
/*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

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];
                                  ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6060 KB Output is correct
2 Correct 0 ms 6060 KB Output is correct
3 Correct 0 ms 6060 KB Output is correct
4 Correct 0 ms 6060 KB Output is correct
5 Correct 0 ms 6060 KB Output is correct
6 Correct 0 ms 6060 KB Output is correct
7 Correct 0 ms 6060 KB Output is correct
8 Correct 0 ms 6060 KB Output is correct
9 Correct 0 ms 6060 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6060 KB Output is correct
2 Correct 0 ms 6060 KB Output is correct
3 Correct 0 ms 6060 KB Output is correct
4 Correct 0 ms 6060 KB Output is correct
5 Correct 0 ms 6060 KB Output is correct
6 Correct 0 ms 6060 KB Output is correct
7 Correct 0 ms 6060 KB Output is correct
8 Correct 0 ms 6060 KB Output is correct
9 Correct 0 ms 6060 KB Output is correct
10 Correct 0 ms 6060 KB Output is correct
11 Correct 0 ms 6060 KB Output is correct
12 Correct 0 ms 6060 KB Output is correct
13 Correct 0 ms 6060 KB Output is correct
14 Correct 0 ms 6060 KB Output is correct
15 Correct 0 ms 6060 KB Output is correct
16 Correct 0 ms 6060 KB Output is correct
17 Correct 0 ms 6060 KB Output is correct
18 Correct 0 ms 6060 KB Output is correct
19 Correct 0 ms 6060 KB Output is correct
20 Correct 0 ms 6060 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6060 KB Output is correct
2 Correct 0 ms 6060 KB Output is correct
3 Correct 0 ms 6060 KB Output is correct
4 Correct 0 ms 6060 KB Output is correct
5 Correct 0 ms 6060 KB Output is correct
6 Correct 0 ms 6060 KB Output is correct
7 Correct 0 ms 6060 KB Output is correct
8 Correct 0 ms 6060 KB Output is correct
9 Correct 0 ms 6060 KB Output is correct
10 Correct 0 ms 6060 KB Output is correct
11 Correct 0 ms 6060 KB Output is correct
12 Correct 0 ms 6060 KB Output is correct
13 Correct 0 ms 6060 KB Output is correct
14 Correct 0 ms 6060 KB Output is correct
15 Correct 0 ms 6060 KB Output is correct
16 Correct 0 ms 6060 KB Output is correct
17 Correct 0 ms 6060 KB Output is correct
18 Correct 0 ms 6060 KB Output is correct
19 Correct 0 ms 6060 KB Output is correct
20 Correct 0 ms 6060 KB Output is correct
21 Correct 36 ms 6060 KB Output is correct
22 Correct 39 ms 6060 KB Output is correct
23 Correct 16 ms 6060 KB Output is correct
24 Correct 76 ms 6060 KB Output is correct
25 Correct 6 ms 6060 KB Output is correct
26 Correct 9 ms 6060 KB Output is correct
27 Correct 6 ms 6060 KB Output is correct
28 Correct 6 ms 6060 KB Output is correct
29 Correct 3 ms 6060 KB Output is correct
30 Correct 16 ms 6060 KB Output is correct
31 Correct 26 ms 6060 KB Output is correct
32 Correct 86 ms 6060 KB Output is correct
33 Correct 0 ms 6060 KB Output is correct
34 Correct 3 ms 6060 KB Output is correct
35 Correct 6 ms 6060 KB Output is correct
36 Correct 86 ms 6060 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6060 KB Output is correct
2 Correct 0 ms 6060 KB Output is correct
3 Correct 0 ms 6060 KB Output is correct
4 Correct 0 ms 6060 KB Output is correct
5 Correct 0 ms 6060 KB Output is correct
6 Correct 0 ms 6060 KB Output is correct
7 Correct 0 ms 6060 KB Output is correct
8 Correct 0 ms 6060 KB Output is correct
9 Correct 0 ms 6060 KB Output is correct
10 Correct 0 ms 6060 KB Output is correct
11 Correct 0 ms 6060 KB Output is correct
12 Correct 0 ms 6060 KB Output is correct
13 Correct 0 ms 6060 KB Output is correct
14 Correct 0 ms 6060 KB Output is correct
15 Correct 0 ms 6060 KB Output is correct
16 Correct 0 ms 6060 KB Output is correct
17 Correct 0 ms 6060 KB Output is correct
18 Correct 0 ms 6060 KB Output is correct
19 Correct 0 ms 6060 KB Output is correct
20 Correct 0 ms 6060 KB Output is correct
21 Correct 36 ms 6060 KB Output is correct
22 Correct 39 ms 6060 KB Output is correct
23 Correct 16 ms 6060 KB Output is correct
24 Correct 76 ms 6060 KB Output is correct
25 Correct 6 ms 6060 KB Output is correct
26 Correct 9 ms 6060 KB Output is correct
27 Correct 6 ms 6060 KB Output is correct
28 Correct 6 ms 6060 KB Output is correct
29 Correct 3 ms 6060 KB Output is correct
30 Correct 16 ms 6060 KB Output is correct
31 Correct 26 ms 6060 KB Output is correct
32 Correct 86 ms 6060 KB Output is correct
33 Correct 0 ms 6060 KB Output is correct
34 Correct 3 ms 6060 KB Output is correct
35 Correct 6 ms 6060 KB Output is correct
36 Correct 86 ms 6060 KB Output is correct
37 Correct 283 ms 6200 KB Output is correct
38 Correct 313 ms 6200 KB Output is correct
39 Correct 39 ms 6060 KB Output is correct
40 Execution timed out 1000 ms 6060 KB Execution timed out
41 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6060 KB Output is correct
2 Correct 0 ms 6060 KB Output is correct
3 Correct 0 ms 6060 KB Output is correct
4 Correct 0 ms 6060 KB Output is correct
5 Correct 0 ms 6060 KB Output is correct
6 Correct 0 ms 6060 KB Output is correct
7 Correct 0 ms 6060 KB Output is correct
8 Correct 0 ms 6060 KB Output is correct
9 Correct 0 ms 6060 KB Output is correct
10 Correct 0 ms 6060 KB Output is correct
11 Correct 0 ms 6060 KB Output is correct
12 Correct 0 ms 6060 KB Output is correct
13 Correct 0 ms 6060 KB Output is correct
14 Correct 0 ms 6060 KB Output is correct
15 Correct 0 ms 6060 KB Output is correct
16 Correct 0 ms 6060 KB Output is correct
17 Correct 0 ms 6060 KB Output is correct
18 Correct 0 ms 6060 KB Output is correct
19 Correct 0 ms 6060 KB Output is correct
20 Correct 0 ms 6060 KB Output is correct
21 Correct 36 ms 6060 KB Output is correct
22 Correct 39 ms 6060 KB Output is correct
23 Correct 16 ms 6060 KB Output is correct
24 Correct 76 ms 6060 KB Output is correct
25 Correct 6 ms 6060 KB Output is correct
26 Correct 9 ms 6060 KB Output is correct
27 Correct 6 ms 6060 KB Output is correct
28 Correct 6 ms 6060 KB Output is correct
29 Correct 3 ms 6060 KB Output is correct
30 Correct 16 ms 6060 KB Output is correct
31 Correct 26 ms 6060 KB Output is correct
32 Correct 86 ms 6060 KB Output is correct
33 Correct 0 ms 6060 KB Output is correct
34 Correct 3 ms 6060 KB Output is correct
35 Correct 6 ms 6060 KB Output is correct
36 Correct 86 ms 6060 KB Output is correct
37 Correct 283 ms 6200 KB Output is correct
38 Correct 313 ms 6200 KB Output is correct
39 Correct 39 ms 6060 KB Output is correct
40 Execution timed out 1000 ms 6060 KB Execution timed out
41 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6060 KB Output is correct
2 Correct 0 ms 6060 KB Output is correct
3 Correct 0 ms 6060 KB Output is correct
4 Correct 0 ms 6060 KB Output is correct
5 Correct 0 ms 6060 KB Output is correct
6 Correct 0 ms 6060 KB Output is correct
7 Correct 0 ms 6060 KB Output is correct
8 Correct 0 ms 6060 KB Output is correct
9 Correct 0 ms 6060 KB Output is correct
10 Correct 0 ms 6060 KB Output is correct
11 Correct 0 ms 6060 KB Output is correct
12 Correct 0 ms 6060 KB Output is correct
13 Correct 0 ms 6060 KB Output is correct
14 Correct 0 ms 6060 KB Output is correct
15 Correct 0 ms 6060 KB Output is correct
16 Correct 0 ms 6060 KB Output is correct
17 Correct 0 ms 6060 KB Output is correct
18 Correct 0 ms 6060 KB Output is correct
19 Correct 0 ms 6060 KB Output is correct
20 Correct 0 ms 6060 KB Output is correct
21 Correct 36 ms 6060 KB Output is correct
22 Correct 39 ms 6060 KB Output is correct
23 Correct 16 ms 6060 KB Output is correct
24 Correct 76 ms 6060 KB Output is correct
25 Correct 6 ms 6060 KB Output is correct
26 Correct 9 ms 6060 KB Output is correct
27 Correct 6 ms 6060 KB Output is correct
28 Correct 6 ms 6060 KB Output is correct
29 Correct 3 ms 6060 KB Output is correct
30 Correct 16 ms 6060 KB Output is correct
31 Correct 26 ms 6060 KB Output is correct
32 Correct 86 ms 6060 KB Output is correct
33 Correct 0 ms 6060 KB Output is correct
34 Correct 3 ms 6060 KB Output is correct
35 Correct 6 ms 6060 KB Output is correct
36 Correct 86 ms 6060 KB Output is correct
37 Correct 283 ms 6200 KB Output is correct
38 Correct 313 ms 6200 KB Output is correct
39 Correct 39 ms 6060 KB Output is correct
40 Execution timed out 1000 ms 6060 KB Execution timed out
41 Halted 0 ms 0 KB -