# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45750 | antimirage | Bali Sculptures (APIO15_sculpture) | C++17 | 28 ms | 32100 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 fr first
#define sc second
#define mk make_pair
#define pb push_back
#define OK puts("OK");
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define int long long
using namespace std;
const int N = 2005;
int n, a, b, ar[N], dp[N][N], pref[N], ans = 1e18;
main()
{
cin >> n >> a >> b;
for (int i = 1; i <= n; i++)
scanf("%lld", &ar[i]), pref[i] = ar[i] + pref[i - 1];
memset ( dp, 0x3f3f3f3f, sizeof(dp) );
dp[0][0] = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int k = 1; k <= j; k++)
dp[i][j] = min(dp[i][j], ( dp[i - 1][k - 1] | (pref[j] - pref[k - 1]) ) );
for (int i = a; i <= b; i++)
ans = min(ans, dp[i][n]);
cout << ans << endl;
}
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... |