Submission #169691

#	Time	Username	Problem	Language	Result	Execution time	Memory
169691		stefdasca	Bootfall (IZhO17_bootfall)	C++14	28 / 100	1073 ms	760 KiB

bootfall

#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

using namespace std;

typedef long long ll;


int add(int a, int b)
{
    ll x = a+b;
    if(x >= mod)
        x -= mod;
    if(x < 0)
        x += mod;
    return x;
}
ll mul(ll a, ll b)
{
    return (a*b) % mod;
}

ll pw(ll a, ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b & 1)
            ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed()
{
    long long a = rng();
    return a;
}
int n;
int v[502];

int frq[1000002];
bool dp[250002];
bool canruk(int lack)
{
    memset(dp, 0, sizeof(dp));
    int mxval = 0;
    dp[0] = 1;
    int sm = 0;
    for(int i = 1; i <= n; ++i)
        if(i != lack)
            sm += v[i];
    for(int i = 1; i <= n; ++i)
    {
        if(i == lack)
            continue;
        for(int j = mxval; j >= 0; --j)
            if(dp[j])
                dp[j + v[i]] = 1;
        mxval += v[i];
        mxval = min(mxval, sm / 2);
    }
    if(lack == 0)
    {
        if(sm % 2 == 0 && dp[sm / 2])
            return 1;
        return 0;
    }
    else
    {
        for(int i = 0; i <= sm/2; ++i)
            if(dp[i])
                frq[sm - 2 * i]++;
        return 1;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> v[i];
    sort(v+1, v+n+1);
    if(!canruk(0))
    {
        cout << 0;
        return 0;
    }
    for(int i = 1; i <= n; ++i)
        canruk(i);
    int nrok = 0;
    for(int i = 0; i <= 1000000; ++i)
        if(frq[i] == n)
            ++nrok;
    cout << nrok << '\n';
    for(int i = 0; i <= 1000000; ++i)
        if(frq[i] == n)
            cout << i << " ";
    return 0;
}

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