# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521339 | ACE_ | Bali Sculptures (APIO15_sculpture) | C++14 | 82 ms | 332 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>
#define int long long
using namespace std;
const int maxn = 2005 + 5, inf = 4000;
int t, a[maxn], dp[maxn];
main(){
int n, A, B;
cin >> n >> A >> B;
for(int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int cur = 0, X = 0;
for(int i = 40; i >= 0; i--) {
X += 1ll << i;
for(int r = 1; r <= n; r++) {
dp[r] = inf;
for(int l = 1; l <= r; l++) {
int sum = (a[r] - a[l - 1]) & X;
if(!((sum ^ cur) & sum)) {
dp[r] = min(dp[l - 1] + 1, dp[r]);
}
}
}
if(dp[n] > B) {
cur += 1ll << i;
}
}
cout << cur;
}
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... |