답안 #315308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315308 2020-10-22T10:14:42 Z dolphingarlic Bootfall (IZhO17_bootfall) C++14
44 / 100
1000 ms 760 KB
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
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 < 250001; 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 < 250001; j += 2) good[j] = (tot - a[i] + j >> 1) >= j && possible[(tot - a[i] + j >> 1) - j];
        ans &= good;
    }

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

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:26:26: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   26 |         for (int j = tot - a[i] & 1; j < 250001; j += 2) good[j] = (tot - a[i] + j >> 1) >= j && possible[(tot - a[i] + j >> 1) - j];
      |                      ~~~~^~~~~~
bootfall.cpp:26:80: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |         for (int j = tot - a[i] & 1; j < 250001; j += 2) good[j] = (tot - a[i] + j >> 1) >= j && possible[(tot - a[i] + j >> 1) - j];
      |                                                                     ~~~~~~~~~~~^~~
bootfall.cpp:26:119: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |         for (int j = tot - a[i] & 1; j < 250001; j += 2) good[j] = (tot - a[i] + j >> 1) >= j && possible[(tot - a[i] + j >> 1) - j];
      |                                                                                                            ~~~~~~~~~~~^~~
bootfall.cpp:30:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::size_t' {aka 'long unsigned int'} [-Wformat=]
   30 |     printf("%d\n", ans.count());
      |             ~^     ~~~~~~~~~~~
      |              |              |
      |              int            std::size_t {aka long unsigned int}
      |             %ld
bootfall.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
bootfall.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |         scanf("%d", a + i);
      |         ~~~~~^~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 17 ms 640 KB Output is correct
11 Correct 18 ms 552 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 14 ms 512 KB Output is correct
14 Correct 16 ms 512 KB Output is correct
15 Correct 15 ms 512 KB Output is correct
16 Correct 17 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 14 ms 512 KB Output is correct
20 Correct 17 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 17 ms 640 KB Output is correct
11 Correct 18 ms 552 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 14 ms 512 KB Output is correct
14 Correct 16 ms 512 KB Output is correct
15 Correct 15 ms 512 KB Output is correct
16 Correct 17 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 14 ms 512 KB Output is correct
20 Correct 17 ms 512 KB Output is correct
21 Correct 52 ms 632 KB Output is correct
22 Correct 65 ms 512 KB Output is correct
23 Correct 35 ms 512 KB Output is correct
24 Correct 96 ms 544 KB Output is correct
25 Correct 96 ms 512 KB Output is correct
26 Correct 108 ms 512 KB Output is correct
27 Correct 107 ms 612 KB Output is correct
28 Correct 107 ms 512 KB Output is correct
29 Correct 107 ms 512 KB Output is correct
30 Correct 106 ms 512 KB Output is correct
31 Correct 109 ms 632 KB Output is correct
32 Correct 112 ms 512 KB Output is correct
33 Correct 109 ms 636 KB Output is correct
34 Correct 107 ms 548 KB Output is correct
35 Correct 107 ms 632 KB Output is correct
36 Correct 109 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 17 ms 640 KB Output is correct
11 Correct 18 ms 552 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 14 ms 512 KB Output is correct
14 Correct 16 ms 512 KB Output is correct
15 Correct 15 ms 512 KB Output is correct
16 Correct 17 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 14 ms 512 KB Output is correct
20 Correct 17 ms 512 KB Output is correct
21 Correct 52 ms 632 KB Output is correct
22 Correct 65 ms 512 KB Output is correct
23 Correct 35 ms 512 KB Output is correct
24 Correct 96 ms 544 KB Output is correct
25 Correct 96 ms 512 KB Output is correct
26 Correct 108 ms 512 KB Output is correct
27 Correct 107 ms 612 KB Output is correct
28 Correct 107 ms 512 KB Output is correct
29 Correct 107 ms 512 KB Output is correct
30 Correct 106 ms 512 KB Output is correct
31 Correct 109 ms 632 KB Output is correct
32 Correct 112 ms 512 KB Output is correct
33 Correct 109 ms 636 KB Output is correct
34 Correct 107 ms 548 KB Output is correct
35 Correct 107 ms 632 KB Output is correct
36 Correct 109 ms 512 KB Output is correct
37 Correct 364 ms 544 KB Output is correct
38 Correct 370 ms 512 KB Output is correct
39 Correct 545 ms 632 KB Output is correct
40 Correct 636 ms 632 KB Output is correct
41 Correct 615 ms 512 KB Output is correct
42 Correct 555 ms 512 KB Output is correct
43 Correct 532 ms 760 KB Output is correct
44 Correct 548 ms 672 KB Output is correct
45 Correct 554 ms 760 KB Output is correct
46 Correct 634 ms 544 KB Output is correct
47 Correct 549 ms 632 KB Output is correct
48 Correct 554 ms 632 KB Output is correct
49 Correct 576 ms 632 KB Output is correct
50 Correct 559 ms 632 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 635 ms 632 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 17 ms 640 KB Output is correct
11 Correct 18 ms 552 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 14 ms 512 KB Output is correct
14 Correct 16 ms 512 KB Output is correct
15 Correct 15 ms 512 KB Output is correct
16 Correct 17 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 14 ms 512 KB Output is correct
20 Correct 17 ms 512 KB Output is correct
21 Correct 52 ms 632 KB Output is correct
22 Correct 65 ms 512 KB Output is correct
23 Correct 35 ms 512 KB Output is correct
24 Correct 96 ms 544 KB Output is correct
25 Correct 96 ms 512 KB Output is correct
26 Correct 108 ms 512 KB Output is correct
27 Correct 107 ms 612 KB Output is correct
28 Correct 107 ms 512 KB Output is correct
29 Correct 107 ms 512 KB Output is correct
30 Correct 106 ms 512 KB Output is correct
31 Correct 109 ms 632 KB Output is correct
32 Correct 112 ms 512 KB Output is correct
33 Correct 109 ms 636 KB Output is correct
34 Correct 107 ms 548 KB Output is correct
35 Correct 107 ms 632 KB Output is correct
36 Correct 109 ms 512 KB Output is correct
37 Correct 364 ms 544 KB Output is correct
38 Correct 370 ms 512 KB Output is correct
39 Correct 545 ms 632 KB Output is correct
40 Correct 636 ms 632 KB Output is correct
41 Correct 615 ms 512 KB Output is correct
42 Correct 555 ms 512 KB Output is correct
43 Correct 532 ms 760 KB Output is correct
44 Correct 548 ms 672 KB Output is correct
45 Correct 554 ms 760 KB Output is correct
46 Correct 634 ms 544 KB Output is correct
47 Correct 549 ms 632 KB Output is correct
48 Correct 554 ms 632 KB Output is correct
49 Correct 576 ms 632 KB Output is correct
50 Correct 559 ms 632 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 635 ms 632 KB Output is correct
53 Correct 777 ms 668 KB Output is correct
54 Execution timed out 1037 ms 760 KB Time limit exceeded
55 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 17 ms 640 KB Output is correct
11 Correct 18 ms 552 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 14 ms 512 KB Output is correct
14 Correct 16 ms 512 KB Output is correct
15 Correct 15 ms 512 KB Output is correct
16 Correct 17 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 14 ms 512 KB Output is correct
20 Correct 17 ms 512 KB Output is correct
21 Correct 52 ms 632 KB Output is correct
22 Correct 65 ms 512 KB Output is correct
23 Correct 35 ms 512 KB Output is correct
24 Correct 96 ms 544 KB Output is correct
25 Correct 96 ms 512 KB Output is correct
26 Correct 108 ms 512 KB Output is correct
27 Correct 107 ms 612 KB Output is correct
28 Correct 107 ms 512 KB Output is correct
29 Correct 107 ms 512 KB Output is correct
30 Correct 106 ms 512 KB Output is correct
31 Correct 109 ms 632 KB Output is correct
32 Correct 112 ms 512 KB Output is correct
33 Correct 109 ms 636 KB Output is correct
34 Correct 107 ms 548 KB Output is correct
35 Correct 107 ms 632 KB Output is correct
36 Correct 109 ms 512 KB Output is correct
37 Correct 364 ms 544 KB Output is correct
38 Correct 370 ms 512 KB Output is correct
39 Correct 545 ms 632 KB Output is correct
40 Correct 636 ms 632 KB Output is correct
41 Correct 615 ms 512 KB Output is correct
42 Correct 555 ms 512 KB Output is correct
43 Correct 532 ms 760 KB Output is correct
44 Correct 548 ms 672 KB Output is correct
45 Correct 554 ms 760 KB Output is correct
46 Correct 634 ms 544 KB Output is correct
47 Correct 549 ms 632 KB Output is correct
48 Correct 554 ms 632 KB Output is correct
49 Correct 576 ms 632 KB Output is correct
50 Correct 559 ms 632 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 635 ms 632 KB Output is correct
53 Correct 777 ms 668 KB Output is correct
54 Execution timed out 1037 ms 760 KB Time limit exceeded
55 Halted 0 ms 0 KB -