oj.uz

Submission #158014

# Submission time Handle Problem Language Result Execution time Memory
158014 2019-10-14T12:46:56 Z hentai_lover Bootfall (IZhO17_bootfall) C++14
13 / 100
 1000 ms 11128 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define lft(x) x * 2
#define rgt(x) x * 2 + 1

#define tm hui_pizda
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz size()
#define cnt continue
#define m_p make_pair
#define fr(i, l, r) for(int i = l; i <= r; ++ i)
#define rf(i, r, l) for(int i = r; i >= l; -- i)
#define all(x) x.begin(), x.end()
#pragma GCC optimize(-O3)
#pragma GCC optimize(Ofast)
#pragma GCC optimize("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using _set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <ll> vl;
typedef vector <pii> vpi;
typedef vector <pll> vpl;

mt19937_64 rnd(time(NULL));

const ll N = 1e6 + 10;
const ll mtrxN = 10;
const ll oo = 1e18 + 10;
const ll B = 500;
const ll mod = 1e9 + 7;

struct mtrx{
    ll m[mtrxN][mtrxN] = {};
};
mtrx mtrx_mult(mtrx a, mtrx b){
    mtrx c;
    fr(i, 0, mtrxN - 1){
        fr(j, 0, mtrxN - 1){
            ll sum = 0;
            fr(x, 0, mtrxN - 1){
                sum += a.m[i][x] * b.m[x][j];
                sum %= mod;
            }
            c.m[i][j] = sum;
        }
    }
    return c;
}
mtrx mtrx_pow(mtrx a, ll n){
    mtrx res;
    fr(i, 0, mtrxN - 1)fr(j, 0, mtrxN - 1)res.m[i][j] = a.m[i][j];
    n --;
    while(n){
        if(n&1)res = mtrx_mult(res, a);
        a = mtrx_mult(a, a);
        n >>= 1;
    }
    return res;
}
ll _pow(ll a, ll n){
    ll r = 1;
    while(n){
        if(n&1)r = r * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return r;
}
ll div(ll x, ll y, ll md){
    return x * _pow(y, md - 2) % md;
}

ll a[N];
ll n, NN;

vector <ll> calc(ll x){
    vector <vl> dp;
    dp.resize(n + 1);
    fr(i, 0, n)dp[i].resize(2 * NN + 1);

    dp[0][NN] = 1;
    fr(i, 1, n){
        if(i != x){
            fr(j, 0, 2 * NN){
                if(j + a[i] <= 2 * NN)dp[i][j + a[i]] |= dp[i - 1][j];
                if(j - a[i] >= 0)dp[i][j - a[i]] |= dp[i - 1][j];
            }
        }   else dp[i] = dp[i - 1];
    }
    return dp[n];
}

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    NN = 10000;
    //NN = 10;

    cin >> n;
    fr(i, 1, n)cin >> a[i];
    vl ans(2 * NN + 1, 1);
    fr(i, 0, n){
        vl now = calc(i);
        if(i == 0){
            if(!now[NN])return cout << 0, 0;
            else cnt;
        }

//        cout << "i: " << i << endl;
//        fr(j, 0, 2 * NN)
//            cout << j - NN << ":" << now[j] << ' ';
//        cout << endl;
        fr(j, 0, 2 * NN)ans[j] &= now[j];
    }

    set <ll> ra;
    fr(i, 0, 2 * NN)
        if(ans[i])ra.insert(abs(i - NN));

    cout << ra.sz << endl;
    for(auto i : ra)cout << i << ' ';
    cout << endl;

    return 0;
}
/*
*/

Compilation message

bootfall.cpp:18:22: warning: '#pragma GCC optimize' is not a string or number [-Wpragmas]
 #pragma GCC optimize(-O3)
                      ^
bootfall.cpp:19:22: warning: '#pragma GCC optimize' is not a string or number [-Wpragmas]
 #pragma GCC optimize(Ofast)
                      ^~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 13 ms 1804 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 7 ms 1500 KB Output is correct
5 Correct 41 ms 2740 KB Output is correct
6 Correct 20 ms 2100 KB Output is correct
7 Correct 13 ms 1836 KB Output is correct
8 Correct 41 ms 2808 KB Output is correct
9 Correct 30 ms 2436 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 13 ms 1804 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 7 ms 1500 KB Output is correct
5 Correct 41 ms 2740 KB Output is correct
6 Correct 20 ms 2100 KB Output is correct
7 Correct 13 ms 1836 KB Output is correct
8 Correct 41 ms 2808 KB Output is correct
9 Correct 30 ms 2436 KB Output is correct
10 Correct 249 ms 5632 KB Output is correct
11 Correct 246 ms 5832 KB Output is correct
12 Correct 239 ms 5852 KB Output is correct
13 Correct 179 ms 5112 KB Output is correct
14 Correct 211 ms 5376 KB Output is correct
15 Correct 228 ms 5368 KB Output is correct
16 Correct 247 ms 5756 KB Output is correct
17 Correct 78 ms 3704 KB Output is correct
18 Correct 157 ms 4732 KB Output is correct
19 Correct 192 ms 4984 KB Output is correct
20 Correct 254 ms 5684 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 13 ms 1804 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 7 ms 1500 KB Output is correct
5 Correct 41 ms 2740 KB Output is correct
6 Correct 20 ms 2100 KB Output is correct
7 Correct 13 ms 1836 KB Output is correct
8 Correct 41 ms 2808 KB Output is correct
9 Correct 30 ms 2436 KB Output is correct
10 Correct 249 ms 5632 KB Output is correct
11 Correct 246 ms 5832 KB Output is correct
12 Correct 239 ms 5852 KB Output is correct
13 Correct 179 ms 5112 KB Output is correct
14 Correct 211 ms 5376 KB Output is correct
15 Correct 228 ms 5368 KB Output is correct
16 Correct 247 ms 5756 KB Output is correct
17 Correct 78 ms 3704 KB Output is correct
18 Correct 157 ms 4732 KB Output is correct
19 Correct 192 ms 4984 KB Output is correct
20 Correct 254 ms 5684 KB Output is correct
21 Execution timed out 1046 ms 11128 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 13 ms 1804 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 7 ms 1500 KB Output is correct
5 Correct 41 ms 2740 KB Output is correct
6 Correct 20 ms 2100 KB Output is correct
7 Correct 13 ms 1836 KB Output is correct
8 Correct 41 ms 2808 KB Output is correct
9 Correct 30 ms 2436 KB Output is correct
10 Correct 249 ms 5632 KB Output is correct
11 Correct 246 ms 5832 KB Output is correct
12 Correct 239 ms 5852 KB Output is correct
13 Correct 179 ms 5112 KB Output is correct
14 Correct 211 ms 5376 KB Output is correct
15 Correct 228 ms 5368 KB Output is correct
16 Correct 247 ms 5756 KB Output is correct
17 Correct 78 ms 3704 KB Output is correct
18 Correct 157 ms 4732 KB Output is correct
19 Correct 192 ms 4984 KB Output is correct
20 Correct 254 ms 5684 KB Output is correct
21 Execution timed out 1046 ms 11128 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 13 ms 1804 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 7 ms 1500 KB Output is correct
5 Correct 41 ms 2740 KB Output is correct
6 Correct 20 ms 2100 KB Output is correct
7 Correct 13 ms 1836 KB Output is correct
8 Correct 41 ms 2808 KB Output is correct
9 Correct 30 ms 2436 KB Output is correct
10 Correct 249 ms 5632 KB Output is correct
11 Correct 246 ms 5832 KB Output is correct
12 Correct 239 ms 5852 KB Output is correct
13 Correct 179 ms 5112 KB Output is correct
14 Correct 211 ms 5376 KB Output is correct
15 Correct 228 ms 5368 KB Output is correct
16 Correct 247 ms 5756 KB Output is correct
17 Correct 78 ms 3704 KB Output is correct
18 Correct 157 ms 4732 KB Output is correct
19 Correct 192 ms 4984 KB Output is correct
20 Correct 254 ms 5684 KB Output is correct
21 Execution timed out 1046 ms 11128 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 13 ms 1804 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 7 ms 1500 KB Output is correct
5 Correct 41 ms 2740 KB Output is correct
6 Correct 20 ms 2100 KB Output is correct
7 Correct 13 ms 1836 KB Output is correct
8 Correct 41 ms 2808 KB Output is correct
9 Correct 30 ms 2436 KB Output is correct
10 Correct 249 ms 5632 KB Output is correct
11 Correct 246 ms 5832 KB Output is correct
12 Correct 239 ms 5852 KB Output is correct
13 Correct 179 ms 5112 KB Output is correct
14 Correct 211 ms 5376 KB Output is correct
15 Correct 228 ms 5368 KB Output is correct
16 Correct 247 ms 5756 KB Output is correct
17 Correct 78 ms 3704 KB Output is correct
18 Correct 157 ms 4732 KB Output is correct
19 Correct 192 ms 4984 KB Output is correct
20 Correct 254 ms 5684 KB Output is correct
21 Execution timed out 1046 ms 11128 KB Time limit exceeded
22 Halted 0 ms 0 KB -