oj.uz

Submission #232906

# Submission time Handle Problem Language Result Execution time Memory
232906 2020-05-18T16:14:11 Z andreiomd Bali Sculptures (APIO15_sculpture) C++11
0 / 100
 5 ms 416 KB 
#include <iostream>

using namespace std;

const int NMAX = 2e3 + 5;

int N, A, B, Y[NMAX];

long long sp[NMAX], BitMask;

static inline void Read ()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> A >> B;

    for(int i = 1; i <= N; ++i)
        cin >> Y[i], sp[i] = sp[i - 1] + 1LL * Y[i];

    return;
}

auto Check = [] (int byte, long long Sum)
{
    if(Sum & (1LL << byte))
        return 0;

    Sum >>= (1LL * (byte + 1));

    if(Sum == BitMask)
        return 1;

    return 0;
};

static inline bool Ok (int byte)
{
    bool dp[N + 1][N + 1];
    for(int i = 0; i <= N; ++i)
        for(int j = 0; j <= N; ++j)
            dp[i][j] = 0;

    dp[0][0] = 1;

    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= i; ++j)
            for(int k = 0; k < i && !dp[i][j]; ++k)
                if(dp[k][j - 1] && Check(byte, sp[i] - sp[k]))
                    dp[i][j] = 1;

    for(int i = A; i <= B; ++i)
        if(dp[N][i])
            return 1;

    return 0;
}

static inline void Solve_1 ()
{
    long long ans = 0;

    for(int i = 41; i >= 0; --i)
    {
        bool Now = Ok(i);
        BitMask = (BitMask << 1LL);

        if(Now)
            continue;
        else
            ans += 1LL * (1LL << i), ++BitMask;
    }

    cout << ans << '\n';

    return;
}

static inline void Solve ()
{
    if(N <= 1e2)
        Solve_1();

    return;
}

int main()
{
    Read();

    Solve();

    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 416 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 3 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -