# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104757 | ekrem | Bali Sculptures (APIO15_sculpture) | C++98 | 3 ms | 432 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 st first
#define nd second
#define mp make_pair
#define pb push_back
#define inf 1000000000000000007
#define N 2005
using namespace std;
typedef long long ll;
ll n, x, y, ans = inf, a[N], pre[N], dp[N][N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%lld %lld %lld",&n ,&x ,&y);
for(int i = 1; i <= n; i++){
scanf("%lld",a + i);
pre[i] = pre[i - 1] + a[i];
}
for(int i = 1; i <= n; i++){
dp[i][0] = inf;
dp[0][i] = inf;
}
for(int i = 1; i <= n; i++)
for(int k = 1; k <= n; k++){
dp[i][k] = inf;
for(int j = i; j >= 1; j--)
dp[i][k] = min(dp[i][k], ((pre[i] - pre[j - 1])|dp[j - 1][k - 1]) );
// cout << i << " " << k << " -> " << dp[i][k] << endl;
}
for(int i = x; i <= y; i++)
ans = min(ans, dp[n][i]);
printf("%lld\n", ans);
return 0;
}
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... |