oj.uz

답안 #158041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
158041 2019-10-14T13:28:14 Z hentai_lover Bootfall (IZhO17_bootfall) C++14
13 / 100
 1000 ms 748 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()

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 int 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 oo = 1e9 + 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 <bool> calc(ll x){
    vector < vector <bool> > 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][j + a[i]] | dp[i - 1][j];

                if(j - a[i] >= 0){
                    dp[i][j - a[i]] = 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), cout.tie(0);
    //NN = 10;

    NN = 0;
    cin >> n;
    if(n % 2 == 1)return cout << 0, 0;
    fr(i, 1, n)cin >> a[i], NN += a[i];
    vector <bool> ans(2 * NN + 1, 1);
    fr(i, 0, n){
        vector <bool> now = calc(i);
        if(i == 0){
            if(!now[NN])return cout << 0, 0;
            else cnt;
        }
        bool ok = 0;
        fr(j, 0, 2 * NN){
            ans[j] = ans[j] & now[j];
            ok |= ans[j];
        }
        if(!ok)return cout << 0, 0;
    }

    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;
}
/*
*/

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 12 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 12 ms 388 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 12 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 12 ms 388 KB Output is correct
21 Correct 240 ms 452 KB Output is correct
22 Correct 347 ms 504 KB Output is correct
23 Correct 110 ms 376 KB Output is correct
24 Correct 760 ms 604 KB Output is correct
25 Execution timed out 1074 ms 748 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 12 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 12 ms 388 KB Output is correct
21 Correct 240 ms 452 KB Output is correct
22 Correct 347 ms 504 KB Output is correct
23 Correct 110 ms 376 KB Output is correct
24 Correct 760 ms 604 KB Output is correct
25 Execution timed out 1074 ms 748 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 12 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 12 ms 388 KB Output is correct
21 Correct 240 ms 452 KB Output is correct
22 Correct 347 ms 504 KB Output is correct
23 Correct 110 ms 376 KB Output is correct
24 Correct 760 ms 604 KB Output is correct
25 Execution timed out 1074 ms 748 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 12 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 12 ms 388 KB Output is correct
21 Correct 240 ms 452 KB Output is correct
22 Correct 347 ms 504 KB Output is correct
23 Correct 110 ms 376 KB Output is correct
24 Correct 760 ms 604 KB Output is correct
25 Execution timed out 1074 ms 748 KB Time limit exceeded
26 Halted 0 ms 0 KB -