# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252631 | ChrisT | Bali Sculptures (APIO15_sculpture) | C++17 | 123 ms | 512 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;
const int MN = 203;
bool dp[MN][MN];
int main () {
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
vector<int> v(n+1);
for (int i = 1; i <= n; i++) {
scanf("%d", &v[i]);
}
long long bad = 0;
for (int bit = 40; bit >= 0; bit--) {
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
for (int k = 1; k <= n; k++) {
for (int i = k; i <= n; i++) {
long long run = 0;
for (int j = i; j >= 1; j--) {
run += v[j];
if (!(run & bad) && !(run >> bit & 1))
dp[k][i] |= dp[k-1][j-1];
}
}
}
for (int i = a; i <= b; i++) {
if (dp[i][n]) {
bad |= 1LL << bit;
break;
}
}
}
printf ("%lld\n",((1LL << 41) - 1) ^ bad);
return 0;
}
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... |