Submission #1119066

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119066		KasymK	Bootfall (IZhO17_bootfall)	C++17	65 / 100	763 ms	10472 KiB

bootfall

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 355;
int v[N];
bitset<N*N> dp, vis[N], tmp;
 
int main(){
    // freopen("file.txt", "r", stdin);
    int n, sm = 0;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d", v+i), sm += v[i];
    dp[0] = 1;
    for(int i = 1; i <= n; ++i)
        dp=dp|(dp<<v[i]);
    if(sm&1 or !dp[sm/2]){
        puts("0");
        return 0;
    }
    for(int ad = 1; ad <= n; ++ad){
        sm -= v[ad];
        dp.reset();
        dp[0] = 1;
        for(int i = 1; i < ad; ++i)
            dp=dp|(dp<<v[i]);
        for(int i = ad+1; i <= n; ++i)
            dp=dp|(dp<<v[i]);
        for(int i = 0; i <= sm; ++i)
            if(dp[i])
                vis[ad][abs(sm-2*i)] = 1;
        sm += v[ad];
    }
    tmp = vis[1];
    for(int ad = 2; ad <= n; ++ad)
        tmp &= vis[ad];
    vector<int> ans;
    for(int i = 0; i <= sm; ++i)
        if(tmp[i])
            ans.pb(i);
    printf("%d\n", (int)ans.size());
    for(auto i : ans)
        printf("%d ", i);
    puts("");
    return 0;
}

Compilation message (stderr)

bootfall.cpp: In function 'int main()':
bootfall.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
bootfall.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d", v+i), sm += v[i];
      |         ~~~~~^~~~~~~~~~~

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