Submission #544024

# Submission time Handle Problem Language Result Execution time Memory
544024 2022-03-31T20:05:38 Z Olympia Bali Sculptures (APIO15_sculpture) C++17
0 / 100
2 ms 316 KB
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <stack>
#include <cstdlib>
#include <queue>
#include <cstdio>
#include <limits.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O1")
#pragma GCC optimization ("unroll-loops")

using namespace std;

class SparseTable {
    vector<vector<int>> dp;
    vector<int> arr;
public:
    int query (int l, int r) {
        if (l == r) {
            return arr[l];
        }
        int sz = log2(r - l);
        return dp[l][sz] + query(l + (1 << sz), r);
    }
    SparseTable (vector<int> arr) {
        this->arr = arr;
        dp.resize(arr.size());
        for (int i = 0; i < arr.size(); i++) {
            dp[i].resize(32);
            dp[i][0] = arr[i];
        }
        for (int j = 1; j < 32; j++) {
            for (int i = 0; i < arr.size(); i++) {
                dp[i][j] = dp[i][j - 1] + dp[min(i + (1 << (j - 1)), (int)arr.size() - 1)][j - 1];
            }
        }
    }
};

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

bool process (SparseTable& st, int A, int B, int N, int mask) {
    int dp[N][N + 1];
    for (int i = 0; i < N; i++) {
        dp[i][1] = submask(mask, st.query(0, i));
    }
    set<int> valid[N];
    for (int i = 0; i < N; i++) {
        for (int j = i; j < N; j++) {
            if (submask(mask, st.query(i, j))) {
                valid[j].insert(i);
            }
        }
    }
    for (int j = 2; j <= N; j++) {
        for (int i = 0; i < N; i++) {
            dp[i][j] = false;
            if (valid[i].empty()) {
                continue;
            }
            auto it = valid[i].begin();
            if ((*it) > i) {
                continue;
            }
            for (int prev = 0; prev < i; prev++) {
                if (dp[prev][j - 1] && submask(mask,st.query(prev + 1, i))) {
                    dp[i][j] = true;
                    break;
                }
            }
        }
    }
    for (int j = A; j <= B; j++) {
        if (dp[N - 1][j]) {
            return true;
        }
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, A, B;
    cin >> N >> A >> B;
    vector<int> arr(N);
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    SparseTable st(arr);
    for (int mask = 0; mask < 100; mask++) {
        if (process(st, A, B, N, mask)) {
            cout << mask << '\n';
            return 0;
        }
    }
}

Compilation message

sculpture.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("O1")
      | 
sculpture.cpp:17: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   17 | #pragma GCC optimization ("unroll-loops")
      | 
sculpture.cpp: In constructor 'SparseTable::SparseTable(std::vector<int>)':
sculpture.cpp:35:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for (int i = 0; i < arr.size(); i++) {
      |                         ~~^~~~~~~~~~~~
sculpture.cpp:40:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             for (int i = 0; i < arr.size(); i++) {
      |                             ~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Incorrect 2 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Incorrect 2 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -
# 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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Incorrect 2 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -
# 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Incorrect 2 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -
# 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 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Incorrect 2 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -