oj.uz

Submission #544047

# Submission time Handle Problem Language Result Execution time Memory
544047 2022-03-31T21:17:19 Z Olympia Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 212 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <bitset>
#include <stack>
#include <cstdlib>
#include <queue>
#include <stdint.h>
#include <cstdio>
#include <limits.h>

using namespace std;

class SparseTable {
    vector<int64_t> pref;
    vector<int64_t> arr;
public:
    int64_t query (int l, int r) {
        return pref[r + 1] - pref[l];
    }
    SparseTable (vector<int64_t> arr) {
        this->arr = arr;
        pref = {0};
        for (int i = 1; i <= arr.size(); i++) {
            pref.push_back(pref.back() + arr[i - 1]);
        }
    }
};

vector<int64_t> powr = {1};

bool submask (int64_t mask, int64_t cur) {
    return ((cur | mask) == mask);
}

bool process (SparseTable& st, int A, int B, int N, int64_t mask) {
    bool dp[N + 1][N];
    bool segments[N][N];
    for (int i = 0; i < N; i++) {
        for (int j = i; j >= 1; j--) {
            segments[i][j - 1] = submask(mask, st.query(j, i));
        }
    }
    for (int i = 0; i < N; i++) {
        dp[1][i] = submask(mask, st.query(0, i));
    }
    for (int i = 0; i < N; i++) {
        for (int j = 2; j <= N; j++) {
            dp[j][i] = false;
            for (int k = 0; k < N; k++) {
                if ((dp[j - 1][k] && segments[i][k])) {
                    dp[j][i] = true;
                }
            }
        }
    }
    for (int j = A; j <= B; j++) {
        if (dp[j][N - 1]) {
            return true;
        }
    }
    return false;
}

int main() {
    //freopen("balancing.in", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, A, B;
    cin >> N >> A >> B;
    vector<int64_t> arr(N);
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    SparseTable st(arr);
    while (powr.size() != 60) {
        powr.push_back(powr.back() * 2);
    }
    const int MX = 58;
    int64_t cur = powr[MX + 1] - 1;
    for (int j = MX; j >= 0; j--) {
        if (process(st, A, B, N, cur - powr[j])) {
            cur -= powr[j];
        }
    }
    cout << cur;
}

Compilation message

sculpture.cpp: In constructor 'SparseTable::SparseTable(std::vector<long int>)':
sculpture.cpp:30:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for (int i = 1; i <= arr.size(); i++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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