# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1050362 | manhlinh1501 | Bali Sculptures (APIO15_sculpture) | C++17 | 4 ms | 31876 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;
using i64 = long long;
const int MAXN = 2e3 + 5;
const i64 oo64 = 2e18;
int N, L, R;
int a[MAXN];
i64 dp[MAXN][MAXN];
i64 prefix[MAXN];
signed main() {
#define TASK "code"
if (fopen(TASK ".inp", "r")) {
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> L >> R;
memset(dp, 0x3f, sizeof dp);
dp[0][0] = 0;
for(int i = 1; i <= N; i++) cin >> a[i];
for(int i = 1; i <= N; i++) prefix[i] = prefix[i - 1] + a[i];
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= i; j++) {
for(int z = 1; z <= R; z++) {
if(dp[j - 1][z - 1] >= oo64) continue;
dp[i][z] = min(dp[i][z], (dp[j - 1][z - 1] | (prefix[i] - prefix[j - 1])));
}
}
}
i64 ans = oo64;
for(int i = L; i <= R; i++) ans = min(ans, dp[N][i]);
cout << ans;
return (0 ^ 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... |