# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
517294 | CodeTiger927 | Bali Sculptures (APIO15_sculpture) | C++14 | 32 ms | 4260 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
using namespace std;
#include <iostream>
#include <cstring>
#define MAXN 2005
int N,A,B;
long long a[MAXN],pref[MAXN];
bool dp[MAXN][MAXN];
bool between(long long l,long long r,long long n) {
return (n >= l && n <= r);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N >> A >> B;
for(int i = 0;i < N;++i) {
cin >> a[i];
pref[i + 1] = a[i] + pref[i];
}
long long pre = 0;
for(int i = 30;i >= 0;--i) {
long long l = pre;
long long r = pre + (1ll << i) - 1;
// cout << pre << " " << l << " " << r << endl;
memset(dp,0,sizeof(dp));
dp[0][0] = true;
for(int j = 1;j <= N;++j) {
for(int k = 1;k <= N;++k) {
for(int t = 0;t < j;++t) {
if(dp[t][k - 1] && ((pref[j] - pref[t]) | r) <= r) {
dp[j][k] = true;
break;
}
}
}
}
bool uwu = false;
for(int j = A;j <= B;++j) {
uwu |= dp[N][j];
}
if(!uwu) {
pre |= (1 << i);
}
}
cout << pre << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |