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;
typedef long long ll;
const int N = 2005;
int n, x, y;
ll a[N], dp[N][N];
int main(){
memset(dp, 31, sizeof dp);
cin >> n >> x >> y;
for (int i = 1; i <= n; i ++)
cin >> a[i], a[i] += a[i - 1], dp[i][1] = a[i];
for (int j = 2; j <= n; j ++){
for (int i = j; i <= n; i ++){
for (int k = j - 1; k < i; k ++)
dp[i][j] = min(dp[i][j], dp[k][j - 1] | (a[i] - a[k]));
}
}
ll ans = 1e18;
for (int i = x; i <= y; i ++)
ans = min(ans, dp[n][i]);
cout << ans << endl;
}
# | 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... |