답안 #36064 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36064	2017-12-05T04:22:33 Z	UncleGrandpa925	Bootfall (IZhO17_bootfall)	C++14	65 / 100	1000 ms	4820 KB

bootfall

/*input
4
1 3 1 5
*/
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define N 505
#define bit(x,y) ((x>>y)&1LL)
#define na(x) (#x) << ":" << x
ostream& operator << (ostream &os, vector<int>&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << sp;
	return os;
}
ostream& operator << (ostream &os, pair<int, int> x) {
	cout << x.fi << sp << x.se << sp;
	return os;
}
ostream& operator << (ostream &os, vector<pair<int, int> >&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << endl;
	return os;
}
const int mod = 1e9 + 7;

int n;
int a[N];
int f[250005];
int sum = 0;
int mark[250005];
vector<int> order;

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

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

signed main() {
	scanf("%d", &n);
	f[0] = 1;
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]), add(a[i]);
	if (sum % 2 || f[sum / 2] == 0) {
		printf("0\n");
		return 0;
	}
	for (int i = 1; i <= n; i++) {
		sub(a[i]);
		int sta = 1; if (sum % 2 == 0) sta++;
		for (int j = sta; j <= sum; j += 2) {
			if (f[(sum + j) / 2 - j])
				mark[j]++;
		}
		add(a[i]);
	}
	for (int i = 1; i <= sum; i++) if (mark[i] == n) order.push_back(i);
	printf("%d\n", order.size());
	for (int i = 0; i < order.size(); i++) {
		printf("%d ", order[i]);
	}
}

Compilation message

bootfall.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<int>&)':
bootfall.cpp:16:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << sp;
                    ^
bootfall.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<std::pair<int, int> >&)':
bootfall.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << endl;
                    ^
bootfall.cpp: In function 'int main()':
bootfall.cpp:70:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
  printf("%d\n", order.size());
                             ^
bootfall.cpp:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < order.size(); i++) {
                    ^
bootfall.cpp:53:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
bootfall.cpp:55:60: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), add(a[i]);
                                                            ^

Subtask #1
6.0 / 6.0

#	결과	메모리	Grader output
1	Correct	3968 KB	Output is correct
2	Correct	3968 KB	Output is correct
3	Correct	3968 KB	Output is correct
4	Correct	3968 KB	Output is correct
5	Correct	3968 KB	Output is correct
6	Correct	3968 KB	Output is correct
7	Correct	3968 KB	Output is correct
8	Correct	3968 KB	Output is correct
9	Correct	3968 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	메모리	Grader output
1	Correct	3968 KB	Output is correct
2	Correct	3968 KB	Output is correct
3	Correct	3968 KB	Output is correct
4	Correct	3968 KB	Output is correct
5	Correct	3968 KB	Output is correct
6	Correct	3968 KB	Output is correct
7	Correct	3968 KB	Output is correct
8	Correct	3968 KB	Output is correct
9	Correct	3968 KB	Output is correct
10	Correct	3968 KB	Output is correct
11	Correct	3968 KB	Output is correct
12	Correct	3968 KB	Output is correct
13	Correct	3968 KB	Output is correct
14	Correct	3968 KB	Output is correct
15	Correct	3968 KB	Output is correct
16	Correct	3968 KB	Output is correct
17	Correct	3968 KB	Output is correct
18	Correct	3968 KB	Output is correct
19	Correct	3968 KB	Output is correct
20	Correct	3968 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	3968 KB	Output is correct
2	Correct	0 ms	3968 KB	Output is correct
3	Correct	0 ms	3968 KB	Output is correct
4	Correct	0 ms	3968 KB	Output is correct
5	Correct	0 ms	3968 KB	Output is correct
6	Correct	0 ms	3968 KB	Output is correct
7	Correct	0 ms	3968 KB	Output is correct
8	Correct	0 ms	3968 KB	Output is correct
9	Correct	0 ms	3968 KB	Output is correct
10	Correct	0 ms	3968 KB	Output is correct
11	Correct	0 ms	3968 KB	Output is correct
12	Correct	0 ms	3968 KB	Output is correct
13	Correct	0 ms	3968 KB	Output is correct
14	Correct	0 ms	3968 KB	Output is correct
15	Correct	0 ms	3968 KB	Output is correct
16	Correct	0 ms	3968 KB	Output is correct
17	Correct	0 ms	3968 KB	Output is correct
18	Correct	0 ms	3968 KB	Output is correct
19	Correct	0 ms	3968 KB	Output is correct
20	Correct	0 ms	3968 KB	Output is correct
21	Correct	3 ms	3968 KB	Output is correct
22	Correct	3 ms	3968 KB	Output is correct
23	Correct	0 ms	3968 KB	Output is correct
24	Correct	6 ms	3968 KB	Output is correct
25	Correct	9 ms	3968 KB	Output is correct
26	Correct	13 ms	3968 KB	Output is correct
27	Correct	9 ms	3968 KB	Output is correct
28	Correct	9 ms	3968 KB	Output is correct
29	Correct	9 ms	3968 KB	Output is correct
30	Correct	6 ms	3968 KB	Output is correct
31	Correct	9 ms	3968 KB	Output is correct
32	Correct	6 ms	3968 KB	Output is correct
33	Correct	3 ms	3968 KB	Output is correct
34	Correct	3 ms	3968 KB	Output is correct
35	Correct	6 ms	3968 KB	Output is correct
36	Correct	6 ms	3968 KB	Output is correct

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	3968 KB	Output is correct
2	Correct	0 ms	3968 KB	Output is correct
3	Correct	0 ms	3968 KB	Output is correct
4	Correct	0 ms	3968 KB	Output is correct
5	Correct	0 ms	3968 KB	Output is correct
6	Correct	0 ms	3968 KB	Output is correct
7	Correct	0 ms	3968 KB	Output is correct
8	Correct	0 ms	3968 KB	Output is correct
9	Correct	0 ms	3968 KB	Output is correct
10	Correct	0 ms	3968 KB	Output is correct
11	Correct	0 ms	3968 KB	Output is correct
12	Correct	0 ms	3968 KB	Output is correct
13	Correct	0 ms	3968 KB	Output is correct
14	Correct	0 ms	3968 KB	Output is correct
15	Correct	0 ms	3968 KB	Output is correct
16	Correct	0 ms	3968 KB	Output is correct
17	Correct	0 ms	3968 KB	Output is correct
18	Correct	0 ms	3968 KB	Output is correct
19	Correct	0 ms	3968 KB	Output is correct
20	Correct	0 ms	3968 KB	Output is correct
21	Correct	3 ms	3968 KB	Output is correct
22	Correct	3 ms	3968 KB	Output is correct
23	Correct	0 ms	3968 KB	Output is correct
24	Correct	6 ms	3968 KB	Output is correct
25	Correct	9 ms	3968 KB	Output is correct
26	Correct	13 ms	3968 KB	Output is correct
27	Correct	9 ms	3968 KB	Output is correct
28	Correct	9 ms	3968 KB	Output is correct
29	Correct	9 ms	3968 KB	Output is correct
30	Correct	6 ms	3968 KB	Output is correct
31	Correct	9 ms	3968 KB	Output is correct
32	Correct	6 ms	3968 KB	Output is correct
33	Correct	3 ms	3968 KB	Output is correct
34	Correct	3 ms	3968 KB	Output is correct
35	Correct	6 ms	3968 KB	Output is correct
36	Correct	6 ms	3968 KB	Output is correct
37	Correct	63 ms	4108 KB	Output is correct
38	Correct	73 ms	4108 KB	Output is correct
39	Correct	66 ms	3968 KB	Output is correct
40	Correct	159 ms	4108 KB	Output is correct
41	Correct	76 ms	3968 KB	Output is correct
42	Correct	139 ms	4108 KB	Output is correct
43	Correct	236 ms	4240 KB	Output is correct
44	Correct	233 ms	4240 KB	Output is correct
45	Correct	253 ms	4240 KB	Output is correct
46	Correct	99 ms	3968 KB	Output is correct
47	Correct	146 ms	4108 KB	Output is correct
48	Correct	223 ms	4240 KB	Output is correct
49	Correct	163 ms	4108 KB	Output is correct
50	Correct	143 ms	4108 KB	Output is correct
51	Correct	26 ms	3968 KB	Output is correct
52	Correct	319 ms	4240 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	3968 KB	Output is correct
2	Correct	0 ms	3968 KB	Output is correct
3	Correct	0 ms	3968 KB	Output is correct
4	Correct	0 ms	3968 KB	Output is correct
5	Correct	0 ms	3968 KB	Output is correct
6	Correct	0 ms	3968 KB	Output is correct
7	Correct	0 ms	3968 KB	Output is correct
8	Correct	0 ms	3968 KB	Output is correct
9	Correct	0 ms	3968 KB	Output is correct
10	Correct	0 ms	3968 KB	Output is correct
11	Correct	0 ms	3968 KB	Output is correct
12	Correct	0 ms	3968 KB	Output is correct
13	Correct	0 ms	3968 KB	Output is correct
14	Correct	0 ms	3968 KB	Output is correct
15	Correct	0 ms	3968 KB	Output is correct
16	Correct	0 ms	3968 KB	Output is correct
17	Correct	0 ms	3968 KB	Output is correct
18	Correct	0 ms	3968 KB	Output is correct
19	Correct	0 ms	3968 KB	Output is correct
20	Correct	0 ms	3968 KB	Output is correct
21	Correct	3 ms	3968 KB	Output is correct
22	Correct	3 ms	3968 KB	Output is correct
23	Correct	0 ms	3968 KB	Output is correct
24	Correct	6 ms	3968 KB	Output is correct
25	Correct	9 ms	3968 KB	Output is correct
26	Correct	13 ms	3968 KB	Output is correct
27	Correct	9 ms	3968 KB	Output is correct
28	Correct	9 ms	3968 KB	Output is correct
29	Correct	9 ms	3968 KB	Output is correct
30	Correct	6 ms	3968 KB	Output is correct
31	Correct	9 ms	3968 KB	Output is correct
32	Correct	6 ms	3968 KB	Output is correct
33	Correct	3 ms	3968 KB	Output is correct
34	Correct	3 ms	3968 KB	Output is correct
35	Correct	6 ms	3968 KB	Output is correct
36	Correct	6 ms	3968 KB	Output is correct
37	Correct	63 ms	4108 KB	Output is correct
38	Correct	73 ms	4108 KB	Output is correct
39	Correct	66 ms	3968 KB	Output is correct
40	Correct	159 ms	4108 KB	Output is correct
41	Correct	76 ms	3968 KB	Output is correct
42	Correct	139 ms	4108 KB	Output is correct
43	Correct	236 ms	4240 KB	Output is correct
44	Correct	233 ms	4240 KB	Output is correct
45	Correct	253 ms	4240 KB	Output is correct
46	Correct	99 ms	3968 KB	Output is correct
47	Correct	146 ms	4108 KB	Output is correct
48	Correct	223 ms	4240 KB	Output is correct
49	Correct	163 ms	4108 KB	Output is correct
50	Correct	143 ms	4108 KB	Output is correct
51	Correct	26 ms	3968 KB	Output is correct
52	Correct	319 ms	4240 KB	Output is correct
53	Correct	249 ms	4240 KB	Output is correct
54	Correct	336 ms	4240 KB	Output is correct
55	Correct	629 ms	4436 KB	Output is correct
56	Correct	286 ms	4240 KB	Output is correct
57	Correct	696 ms	4436 KB	Output is correct
58	Correct	406 ms	4240 KB	Output is correct
59	Correct	473 ms	4436 KB	Output is correct
60	Correct	66 ms	3968 KB	Output is correct
61	Correct	523 ms	4436 KB	Output is correct
62	Correct	549 ms	4436 KB	Output is correct
63	Correct	569 ms	4436 KB	Output is correct
64	Correct	529 ms	4436 KB	Output is correct
65	Correct	83 ms	3968 KB	Output is correct
66	Correct	116 ms	4108 KB	Output is correct

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	3968 KB	Output is correct
2	Correct	0 ms	3968 KB	Output is correct
3	Correct	0 ms	3968 KB	Output is correct
4	Correct	0 ms	3968 KB	Output is correct
5	Correct	0 ms	3968 KB	Output is correct
6	Correct	0 ms	3968 KB	Output is correct
7	Correct	0 ms	3968 KB	Output is correct
8	Correct	0 ms	3968 KB	Output is correct
9	Correct	0 ms	3968 KB	Output is correct
10	Correct	0 ms	3968 KB	Output is correct
11	Correct	0 ms	3968 KB	Output is correct
12	Correct	0 ms	3968 KB	Output is correct
13	Correct	0 ms	3968 KB	Output is correct
14	Correct	0 ms	3968 KB	Output is correct
15	Correct	0 ms	3968 KB	Output is correct
16	Correct	0 ms	3968 KB	Output is correct
17	Correct	0 ms	3968 KB	Output is correct
18	Correct	0 ms	3968 KB	Output is correct
19	Correct	0 ms	3968 KB	Output is correct
20	Correct	0 ms	3968 KB	Output is correct
21	Correct	3 ms	3968 KB	Output is correct
22	Correct	3 ms	3968 KB	Output is correct
23	Correct	0 ms	3968 KB	Output is correct
24	Correct	6 ms	3968 KB	Output is correct
25	Correct	9 ms	3968 KB	Output is correct
26	Correct	13 ms	3968 KB	Output is correct
27	Correct	9 ms	3968 KB	Output is correct
28	Correct	9 ms	3968 KB	Output is correct
29	Correct	9 ms	3968 KB	Output is correct
30	Correct	6 ms	3968 KB	Output is correct
31	Correct	9 ms	3968 KB	Output is correct
32	Correct	6 ms	3968 KB	Output is correct
33	Correct	3 ms	3968 KB	Output is correct
34	Correct	3 ms	3968 KB	Output is correct
35	Correct	6 ms	3968 KB	Output is correct
36	Correct	6 ms	3968 KB	Output is correct
37	Correct	63 ms	4108 KB	Output is correct
38	Correct	73 ms	4108 KB	Output is correct
39	Correct	66 ms	3968 KB	Output is correct
40	Correct	159 ms	4108 KB	Output is correct
41	Correct	76 ms	3968 KB	Output is correct
42	Correct	139 ms	4108 KB	Output is correct
43	Correct	236 ms	4240 KB	Output is correct
44	Correct	233 ms	4240 KB	Output is correct
45	Correct	253 ms	4240 KB	Output is correct
46	Correct	99 ms	3968 KB	Output is correct
47	Correct	146 ms	4108 KB	Output is correct
48	Correct	223 ms	4240 KB	Output is correct
49	Correct	163 ms	4108 KB	Output is correct
50	Correct	143 ms	4108 KB	Output is correct
51	Correct	26 ms	3968 KB	Output is correct
52	Correct	319 ms	4240 KB	Output is correct
53	Correct	249 ms	4240 KB	Output is correct
54	Correct	336 ms	4240 KB	Output is correct
55	Correct	629 ms	4436 KB	Output is correct
56	Correct	286 ms	4240 KB	Output is correct
57	Correct	696 ms	4436 KB	Output is correct
58	Correct	406 ms	4240 KB	Output is correct
59	Correct	473 ms	4436 KB	Output is correct
60	Correct	66 ms	3968 KB	Output is correct
61	Correct	523 ms	4436 KB	Output is correct
62	Correct	549 ms	4436 KB	Output is correct
63	Correct	569 ms	4436 KB	Output is correct
64	Correct	529 ms	4436 KB	Output is correct
65	Correct	83 ms	3968 KB	Output is correct
66	Correct	116 ms	4108 KB	Output is correct
67	Correct	519 ms	4436 KB	Output is correct
68	Correct	129 ms	3968 KB	Output is correct
69	Execution timed out	1000 ms	4820 KB	Execution timed out
70	Halted	0 ms	0 KB	-

답안 #36064

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.0 / 15.0

Subtask #4 16.0 / 16.0

Subtask #5 21.0 / 21.0

Subtask #6 0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
15.0 / 15.0

Subtask #4
16.0 / 16.0

Subtask #5
21.0 / 21.0

Subtask #6
0 / 35.0