#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 <cstdio>
#include <limits.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O1")
#pragma GCC optimization ("unroll-loops")
using namespace std;
class SparseTable {
vector<vector<int64_t>> dp;
vector<int64_t> arr;
public:
int64_t 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<int64_t> 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];
}
}
}
};
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) {
bitset<2000> dp[N + 1];
bitset<2000> segments[N];
for (int i = 0; i < N; i++) {
for (int j = 1; j <= i; j++) {
if (submask(mask, st.query(j, i))) {
segments[i].set(j - 1);
}
}
}
for (int i = 0; i < N; i++) {
if (submask(mask, st.query(0, i))) {
dp[1].set(i);
}
}
for (int j = 2; j <= N; j++) {
for (int i = 0; i < N; i++) {
if ((dp[j - 1] & segments[i]).count()) {
dp[j].set(i);
}
}
}
for (int j = A; j <= B; j++) {
if (dp[j][N - 1]) {
return true;
}
}
return false;
}
int main() {
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 = 59;
int64_t cur = powr[MX + 1] - 1;
//cout << cur << '\n';
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:17: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
17 | #pragma GCC optimization ("O1")
|
sculpture.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
18 | #pragma GCC optimization ("unroll-loops")
|
sculpture.cpp: In constructor 'SparseTable::SparseTable(std::vector<long int>)':
sculpture.cpp:36:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
36 | for (int i = 0; i < arr.size(); i++) {
| ~~^~~~~~~~~~~~
sculpture.cpp:41:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
41 | for (int i = 0; i < arr.size(); i++) {
| ~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
