oj.uz

답안 #315365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315365 2020-10-22T17:11:54 Z dolphingarlic Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 888 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 <= 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:26:26: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   26 |         for (int j = tot - a[i] & 1; j <= tot - a[i]; j += 2) good[j] = possible[tot - a[i] - j >> 1];
      |                      ~~~~^~~~~~
bootfall.cpp:26:93: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   26 |         for (int j = tot - a[i] & 1; j <= tot - a[i]; j += 2) good[j] = possible[tot - a[i] - j >> 1];
      |                                                                                  ~~~~~~~~~~~^~~
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);
      |         ~~~~~^~~~~~~~~~~~~

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 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 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 1 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 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 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 1 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 8 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 8 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 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 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 1 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 8 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 32 ms 512 KB Output is correct
22 Correct 43 ms 512 KB Output is correct
23 Correct 20 ms 512 KB Output is correct
24 Correct 72 ms 512 KB Output is correct
25 Correct 69 ms 512 KB Output is correct
26 Correct 78 ms 512 KB Output is correct
27 Correct 78 ms 512 KB Output is correct
28 Correct 79 ms 512 KB Output is correct
29 Correct 79 ms 548 KB Output is correct
30 Correct 77 ms 544 KB Output is correct
31 Correct 78 ms 512 KB Output is correct
32 Correct 79 ms 632 KB Output is correct
33 Correct 80 ms 676 KB Output is correct
34 Correct 78 ms 512 KB Output is correct
35 Correct 79 ms 632 KB Output is correct
36 Correct 77 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 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 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 1 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 8 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 32 ms 512 KB Output is correct
22 Correct 43 ms 512 KB Output is correct
23 Correct 20 ms 512 KB Output is correct
24 Correct 72 ms 512 KB Output is correct
25 Correct 69 ms 512 KB Output is correct
26 Correct 78 ms 512 KB Output is correct
27 Correct 78 ms 512 KB Output is correct
28 Correct 79 ms 512 KB Output is correct
29 Correct 79 ms 548 KB Output is correct
30 Correct 77 ms 544 KB Output is correct
31 Correct 78 ms 512 KB Output is correct
32 Correct 79 ms 632 KB Output is correct
33 Correct 80 ms 676 KB Output is correct
34 Correct 78 ms 512 KB Output is correct
35 Correct 79 ms 632 KB Output is correct
36 Correct 77 ms 512 KB Output is correct
37 Correct 309 ms 632 KB Output is correct
38 Correct 314 ms 512 KB Output is correct
39 Correct 490 ms 632 KB Output is correct
40 Correct 571 ms 544 KB Output is correct
41 Correct 564 ms 632 KB Output is correct
42 Correct 503 ms 544 KB Output is correct
43 Correct 475 ms 760 KB Output is correct
44 Correct 491 ms 632 KB Output is correct
45 Correct 498 ms 632 KB Output is correct
46 Correct 571 ms 544 KB Output is correct
47 Correct 486 ms 632 KB Output is correct
48 Correct 519 ms 632 KB Output is correct
49 Correct 507 ms 632 KB Output is correct
50 Correct 488 ms 632 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 563 ms 760 KB Output is correct

Subtask #5
21.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 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 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 1 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 8 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 32 ms 512 KB Output is correct
22 Correct 43 ms 512 KB Output is correct
23 Correct 20 ms 512 KB Output is correct
24 Correct 72 ms 512 KB Output is correct
25 Correct 69 ms 512 KB Output is correct
26 Correct 78 ms 512 KB Output is correct
27 Correct 78 ms 512 KB Output is correct
28 Correct 79 ms 512 KB Output is correct
29 Correct 79 ms 548 KB Output is correct
30 Correct 77 ms 544 KB Output is correct
31 Correct 78 ms 512 KB Output is correct
32 Correct 79 ms 632 KB Output is correct
33 Correct 80 ms 676 KB Output is correct
34 Correct 78 ms 512 KB Output is correct
35 Correct 79 ms 632 KB Output is correct
36 Correct 77 ms 512 KB Output is correct
37 Correct 309 ms 632 KB Output is correct
38 Correct 314 ms 512 KB Output is correct
39 Correct 490 ms 632 KB Output is correct
40 Correct 571 ms 544 KB Output is correct
41 Correct 564 ms 632 KB Output is correct
42 Correct 503 ms 544 KB Output is correct
43 Correct 475 ms 760 KB Output is correct
44 Correct 491 ms 632 KB Output is correct
45 Correct 498 ms 632 KB Output is correct
46 Correct 571 ms 544 KB Output is correct
47 Correct 486 ms 632 KB Output is correct
48 Correct 519 ms 632 KB Output is correct
49 Correct 507 ms 632 KB Output is correct
50 Correct 488 ms 632 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 563 ms 760 KB Output is correct
53 Correct 702 ms 760 KB Output is correct
54 Correct 958 ms 760 KB Output is correct
55 Correct 949 ms 760 KB Output is correct
56 Correct 729 ms 680 KB Output is correct
57 Correct 954 ms 888 KB Output is correct
58 Correct 956 ms 632 KB Output is correct
59 Correct 957 ms 760 KB Output is correct
60 Correct 3 ms 384 KB Output is correct
61 Correct 983 ms 760 KB Output is correct
62 Correct 798 ms 888 KB Output is correct
63 Correct 806 ms 888 KB Output is correct
64 Correct 771 ms 888 KB Output is correct
65 Correct 770 ms 632 KB Output is correct
66 Correct 744 ms 632 KB Output is correct

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 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 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 1 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 8 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 32 ms 512 KB Output is correct
22 Correct 43 ms 512 KB Output is correct
23 Correct 20 ms 512 KB Output is correct
24 Correct 72 ms 512 KB Output is correct
25 Correct 69 ms 512 KB Output is correct
26 Correct 78 ms 512 KB Output is correct
27 Correct 78 ms 512 KB Output is correct
28 Correct 79 ms 512 KB Output is correct
29 Correct 79 ms 548 KB Output is correct
30 Correct 77 ms 544 KB Output is correct
31 Correct 78 ms 512 KB Output is correct
32 Correct 79 ms 632 KB Output is correct
33 Correct 80 ms 676 KB Output is correct
34 Correct 78 ms 512 KB Output is correct
35 Correct 79 ms 632 KB Output is correct
36 Correct 77 ms 512 KB Output is correct
37 Correct 309 ms 632 KB Output is correct
38 Correct 314 ms 512 KB Output is correct
39 Correct 490 ms 632 KB Output is correct
40 Correct 571 ms 544 KB Output is correct
41 Correct 564 ms 632 KB Output is correct
42 Correct 503 ms 544 KB Output is correct
43 Correct 475 ms 760 KB Output is correct
44 Correct 491 ms 632 KB Output is correct
45 Correct 498 ms 632 KB Output is correct
46 Correct 571 ms 544 KB Output is correct
47 Correct 486 ms 632 KB Output is correct
48 Correct 519 ms 632 KB Output is correct
49 Correct 507 ms 632 KB Output is correct
50 Correct 488 ms 632 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 563 ms 760 KB Output is correct
53 Correct 702 ms 760 KB Output is correct
54 Correct 958 ms 760 KB Output is correct
55 Correct 949 ms 760 KB Output is correct
56 Correct 729 ms 680 KB Output is correct
57 Correct 954 ms 888 KB Output is correct
58 Correct 956 ms 632 KB Output is correct
59 Correct 957 ms 760 KB Output is correct
60 Correct 3 ms 384 KB Output is correct
61 Correct 983 ms 760 KB Output is correct
62 Correct 798 ms 888 KB Output is correct
63 Correct 806 ms 888 KB Output is correct
64 Correct 771 ms 888 KB Output is correct
65 Correct 770 ms 632 KB Output is correct
66 Correct 744 ms 632 KB Output is correct
67 Execution timed out 1092 ms 512 KB Time limit exceeded
68 Halted 0 ms 0 KB -