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;
#define f first
#define s second
#define int long long
const int maxn = 110;
const int inf = 1e18;
int dp[maxn][maxn], a[maxn], l, r, n;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n >> l >> r;
for (int i = 1;i <= n;i++)
cin >> a[i];
for (int i = 0;i <= n;i++) {
for (int j = 0;j <= n;j++)
dp[i][j] = inf;
}
dp[0][0] = 0;
for (int j = 1;j <= n;j++) {
for (int i = 1;i <= n;i++) {
if (j > i)
continue;
int sm = a[i];
for (int k = i - 1;k >= 0;k--) {
dp[i][j] = min(dp[i][j], dp[k][j - 1] | sm);
sm += a[k];
}
}
}
int ans = inf;
for (int i = l;i <= r;i++)
ans = min(ans, dp[n][i]);
cout << ans;
}
return 0;
}
# | 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... |