# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45728 | Just_Solve_The_Problem | Bali Sculptures (APIO15_sculpture) | C++14 | 2 ms | 584 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;
#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
const int N = (int)2e3 + 7;
const int inf = (int)1e9 + 7;
int n, a, b;
int ar[N];
ll dp[N][N];
ll pref[N];
ll get(int l, int r) {
return pref[r] - pref[l - 1];
}
main() {
scanf("%d %d %d", &n, &a, &b);
for (int i = 1; i <= n; i++) {
scanf("%d", &ar[i]);
pref[i] = pref[i - 1] + ar[i];
}
for (int j = 1; j <= n; j++) {
dp[1][j] = pref[j];
// cout << dp[1][j] << ' ';
}
// cout << endl;
for (int i = 2; i <= b; i++) {
for (int j = 1; j <= n; j++) {
dp[i][j] = dp[i - 1][j];
for (int k = 2; k <= j; k++) {
dp[i][j] = min(dp[i][j], dp[i - 1][k - 1] | get(k, j));
}
// cout << dp[i][j] << ' ';
}
// cout << endl;
}
ll mn = 1e18;
for (int i = a; i <= b; i++) {
mn = min(mn, dp[i][n]);
}
cout << mn;
}
/*
5 4 5
6 2 2 9 0
11
*/
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... |