# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249856 | Nightlight | Bali Sculptures (APIO15_sculpture) | C++14 | 1 ms | 384 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.
#include <bits/stdc++.h>
using namespace std;
int N, A, B;
long long pre[2005];
long long mask;
bitset<2005> valid[2005];
long long ans = (1LL << 42) - 1;
bool check(long long T) {
return ((T | mask) ^ mask) == 0;
}
bool can(int X) {
for(int i = 1; i < N; i++) {
for(int j = i + 1; j <= N; j++) {
valid[i][j] = check(pre[j] - pre[i]);
}
}
bitset<2005> now[2];
for(int j = 1; j <= N; j++) {
if(check(pre[j])) {
now[1] |= valid[j];
}
}
// if(A == 1 && check(pre[N])) return 1;
int skrg, sblm;
for(int i = 1; i <= B; i++) {
skrg = i & 1, sblm = !skrg;
now[skrg] = 0;
for(int j = i; j <= N; j++) {
if(now[sblm][j]) {
now[skrg] |= valid[j];
}
}
if(i >= A && now[sblm][N]) return 1;
}
return 0;
}
int main() {
scanf("%d %d %d", &N, &A, &B);
for(int i = 1; i <= N; i++) {
scanf("%lld", &pre[i]);
pre[i] += pre[i - 1];
}
for(int i = 41; i >= 0; i--) {
mask = ans - (1LL << i);
if(can(i)) {
ans -= (1LL << i);
}
}
printf("%lld\n", ans);
}
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... |