답안 #315311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
315311	2020-10-22T10:19:40 Z	dolphingarlic	Bootfall (IZhO17_bootfall)	C++14	44 / 100	1000 ms	888 KB

bootfall

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, a[500], tot = 0;
    scanf("%d", &n);
    bitset<250001> base;
    base[0] = 1;
    for (int i = 0; i < n; i++) {
        scanf("%d", a + i);
        tot += a[i];
        base |= base << a[i];
    }
    if ((tot & 1) || !base[tot >> 1]) return printf("0"), 0;

    bitset<250001> ans;
    for (int i = 1; i <= tot; i++) ans[i] = 1;

    for (int i = 0; i < n; i++) {
        bitset<250001> possible, good;
        possible[0] = 1;
        for (int j = 0; j < n; j++) if (j != i) possible |= possible << a[j];
        for (int j = tot - a[i] & 1; j <= tot - a[i]; j += 2) good[j] = possible[tot - a[i] - j >> 1];
        ans &= good;
    }

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

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:23:26: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   23 |         for (int j = tot - a[i] & 1; j <= tot - a[i]; j += 2) good[j] = possible[tot - a[i] - j >> 1];
      |                      ~~~~^~~~~~
bootfall.cpp:23:93: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   23 |         for (int j = tot - a[i] & 1; j <= tot - a[i]; j += 2) good[j] = possible[tot - a[i] - j >> 1];
      |                                                                                  ~~~~~~~~~~~^~~
bootfall.cpp:27:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::size_t' {aka 'long unsigned int'} [-Wformat=]
   27 |     printf("%d\n", ans.count());
      |             ~^     ~~~~~~~~~~~
      |              |              |
      |              int            std::size_t {aka long unsigned int}
      |             %ld
bootfall.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    6 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
bootfall.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |         scanf("%d", a + i);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	640 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	640 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	10 ms	512 KB	Output is correct
11	Correct	10 ms	512 KB	Output is correct
12	Correct	10 ms	512 KB	Output is correct
13	Correct	7 ms	512 KB	Output is correct
14	Correct	9 ms	512 KB	Output is correct
15	Correct	8 ms	512 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	4 ms	512 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	7 ms	512 KB	Output is correct
20	Correct	10 ms	512 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	640 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	10 ms	512 KB	Output is correct
11	Correct	10 ms	512 KB	Output is correct
12	Correct	10 ms	512 KB	Output is correct
13	Correct	7 ms	512 KB	Output is correct
14	Correct	9 ms	512 KB	Output is correct
15	Correct	8 ms	512 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	4 ms	512 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	7 ms	512 KB	Output is correct
20	Correct	10 ms	512 KB	Output is correct
21	Correct	42 ms	512 KB	Output is correct
22	Correct	56 ms	512 KB	Output is correct
23	Correct	26 ms	632 KB	Output is correct
24	Correct	91 ms	636 KB	Output is correct
25	Correct	90 ms	512 KB	Output is correct
26	Correct	102 ms	512 KB	Output is correct
27	Correct	100 ms	512 KB	Output is correct
28	Correct	102 ms	664 KB	Output is correct
29	Correct	100 ms	512 KB	Output is correct
30	Correct	99 ms	512 KB	Output is correct
31	Correct	101 ms	512 KB	Output is correct
32	Correct	102 ms	608 KB	Output is correct
33	Correct	99 ms	512 KB	Output is correct
34	Correct	104 ms	512 KB	Output is correct
35	Correct	104 ms	632 KB	Output is correct
36	Correct	99 ms	512 KB	Output is correct

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	640 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	10 ms	512 KB	Output is correct
11	Correct	10 ms	512 KB	Output is correct
12	Correct	10 ms	512 KB	Output is correct
13	Correct	7 ms	512 KB	Output is correct
14	Correct	9 ms	512 KB	Output is correct
15	Correct	8 ms	512 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	4 ms	512 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	7 ms	512 KB	Output is correct
20	Correct	10 ms	512 KB	Output is correct
21	Correct	42 ms	512 KB	Output is correct
22	Correct	56 ms	512 KB	Output is correct
23	Correct	26 ms	632 KB	Output is correct
24	Correct	91 ms	636 KB	Output is correct
25	Correct	90 ms	512 KB	Output is correct
26	Correct	102 ms	512 KB	Output is correct
27	Correct	100 ms	512 KB	Output is correct
28	Correct	102 ms	664 KB	Output is correct
29	Correct	100 ms	512 KB	Output is correct
30	Correct	99 ms	512 KB	Output is correct
31	Correct	101 ms	512 KB	Output is correct
32	Correct	102 ms	608 KB	Output is correct
33	Correct	99 ms	512 KB	Output is correct
34	Correct	104 ms	512 KB	Output is correct
35	Correct	104 ms	632 KB	Output is correct
36	Correct	99 ms	512 KB	Output is correct
37	Correct	402 ms	512 KB	Output is correct
38	Correct	406 ms	632 KB	Output is correct
39	Correct	628 ms	544 KB	Output is correct
40	Correct	738 ms	632 KB	Output is correct
41	Correct	748 ms	540 KB	Output is correct
42	Correct	629 ms	548 KB	Output is correct
43	Correct	615 ms	888 KB	Output is correct
44	Correct	634 ms	668 KB	Output is correct
45	Correct	644 ms	668 KB	Output is correct
46	Correct	723 ms	632 KB	Output is correct
47	Correct	645 ms	544 KB	Output is correct
48	Correct	650 ms	640 KB	Output is correct
49	Correct	645 ms	632 KB	Output is correct
50	Correct	637 ms	632 KB	Output is correct
51	Correct	3 ms	384 KB	Output is correct
52	Correct	745 ms	672 KB	Output is correct

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	640 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	10 ms	512 KB	Output is correct
11	Correct	10 ms	512 KB	Output is correct
12	Correct	10 ms	512 KB	Output is correct
13	Correct	7 ms	512 KB	Output is correct
14	Correct	9 ms	512 KB	Output is correct
15	Correct	8 ms	512 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	4 ms	512 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	7 ms	512 KB	Output is correct
20	Correct	10 ms	512 KB	Output is correct
21	Correct	42 ms	512 KB	Output is correct
22	Correct	56 ms	512 KB	Output is correct
23	Correct	26 ms	632 KB	Output is correct
24	Correct	91 ms	636 KB	Output is correct
25	Correct	90 ms	512 KB	Output is correct
26	Correct	102 ms	512 KB	Output is correct
27	Correct	100 ms	512 KB	Output is correct
28	Correct	102 ms	664 KB	Output is correct
29	Correct	100 ms	512 KB	Output is correct
30	Correct	99 ms	512 KB	Output is correct
31	Correct	101 ms	512 KB	Output is correct
32	Correct	102 ms	608 KB	Output is correct
33	Correct	99 ms	512 KB	Output is correct
34	Correct	104 ms	512 KB	Output is correct
35	Correct	104 ms	632 KB	Output is correct
36	Correct	99 ms	512 KB	Output is correct
37	Correct	402 ms	512 KB	Output is correct
38	Correct	406 ms	632 KB	Output is correct
39	Correct	628 ms	544 KB	Output is correct
40	Correct	738 ms	632 KB	Output is correct
41	Correct	748 ms	540 KB	Output is correct
42	Correct	629 ms	548 KB	Output is correct
43	Correct	615 ms	888 KB	Output is correct
44	Correct	634 ms	668 KB	Output is correct
45	Correct	644 ms	668 KB	Output is correct
46	Correct	723 ms	632 KB	Output is correct
47	Correct	645 ms	544 KB	Output is correct
48	Correct	650 ms	640 KB	Output is correct
49	Correct	645 ms	632 KB	Output is correct
50	Correct	637 ms	632 KB	Output is correct
51	Correct	3 ms	384 KB	Output is correct
52	Correct	745 ms	672 KB	Output is correct
53	Correct	918 ms	676 KB	Output is correct
54	Execution timed out	1063 ms	512 KB	Time limit exceeded
55	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	640 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	10 ms	512 KB	Output is correct
11	Correct	10 ms	512 KB	Output is correct
12	Correct	10 ms	512 KB	Output is correct
13	Correct	7 ms	512 KB	Output is correct
14	Correct	9 ms	512 KB	Output is correct
15	Correct	8 ms	512 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	4 ms	512 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	7 ms	512 KB	Output is correct
20	Correct	10 ms	512 KB	Output is correct
21	Correct	42 ms	512 KB	Output is correct
22	Correct	56 ms	512 KB	Output is correct
23	Correct	26 ms	632 KB	Output is correct
24	Correct	91 ms	636 KB	Output is correct
25	Correct	90 ms	512 KB	Output is correct
26	Correct	102 ms	512 KB	Output is correct
27	Correct	100 ms	512 KB	Output is correct
28	Correct	102 ms	664 KB	Output is correct
29	Correct	100 ms	512 KB	Output is correct
30	Correct	99 ms	512 KB	Output is correct
31	Correct	101 ms	512 KB	Output is correct
32	Correct	102 ms	608 KB	Output is correct
33	Correct	99 ms	512 KB	Output is correct
34	Correct	104 ms	512 KB	Output is correct
35	Correct	104 ms	632 KB	Output is correct
36	Correct	99 ms	512 KB	Output is correct
37	Correct	402 ms	512 KB	Output is correct
38	Correct	406 ms	632 KB	Output is correct
39	Correct	628 ms	544 KB	Output is correct
40	Correct	738 ms	632 KB	Output is correct
41	Correct	748 ms	540 KB	Output is correct
42	Correct	629 ms	548 KB	Output is correct
43	Correct	615 ms	888 KB	Output is correct
44	Correct	634 ms	668 KB	Output is correct
45	Correct	644 ms	668 KB	Output is correct
46	Correct	723 ms	632 KB	Output is correct
47	Correct	645 ms	544 KB	Output is correct
48	Correct	650 ms	640 KB	Output is correct
49	Correct	645 ms	632 KB	Output is correct
50	Correct	637 ms	632 KB	Output is correct
51	Correct	3 ms	384 KB	Output is correct
52	Correct	745 ms	672 KB	Output is correct
53	Correct	918 ms	676 KB	Output is correct
54	Execution timed out	1063 ms	512 KB	Time limit exceeded
55	Halted	0 ms	0 KB	-

답안 #315311

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 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
0 / 21.0

Subtask #6
0 / 35.0