Submission #315305

#	Time	Username	Problem	Language	Result	Execution time	Memory
315305		dolphingarlic	Bootfall (IZhO17_bootfall)	C++14	44 / 100	1089 ms	760 KiB

bootfall

#include <bits/stdc++.h>
#pragma GCC Optimize("unroll-loops")
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 = 1; j <= tot - a[i]; j++) good[j] = !(tot - a[i] + j & 1) && (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 <= tot; i++) if (ans[i]) printf("%d ", i);
    return 0;
}

Compilation message (stderr)

bootfall.cpp:2: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
    2 | #pragma GCC Optimize("unroll-loops")
      | 
bootfall.cpp: In function 'int main()':
bootfall.cpp:24:70: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   24 |         for (int j = 1; j <= tot - a[i]; j++) good[j] = !(tot - a[i] + j & 1) && (tot - a[i] + j >> 1) >= j && possible[(tot - a[i] + j >> 1) - j];
      |                                                           ~~~~~~~~~~~^~~
bootfall.cpp:24:94: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |         for (int j = 1; j <= tot - a[i]; j++) good[j] = !(tot - a[i] + j & 1) && (tot - a[i] + j >> 1) >= j && possible[(tot - a[i] + j >> 1) - j];
      |                                                                                   ~~~~~~~~~~~^~~
bootfall.cpp:24:133: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |         for (int j = 1; j <= tot - a[i]; j++) good[j] = !(tot - a[i] + j & 1) && (tot - a[i] + j >> 1) >= j && possible[(tot - a[i] + j >> 1) - j];
      |                                                                                                                          ~~~~~~~~~~~^~~
bootfall.cpp:28:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::size_t' {aka 'long unsigned int'} [-Wformat=]
   28 |     printf("%d\n", ans.count());
      |             ~^     ~~~~~~~~~~~
      |              |              |
      |              int            std::size_t {aka long unsigned int}
      |             %ld
bootfall.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    7 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
bootfall.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 |         scanf("%d", a + i);
      |         ~~~~~^~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 15 / 15
• Subtask 4: 16 / 16
• Subtask 5: 0 / 21
• Subtask 6: 0 / 35