# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45883 | Just_Solve_The_Problem | Bali Sculptures (APIO15_sculpture) | C++11 | 138 ms | 764 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 ar[N];
int dp[N];
int n, a, b;
ll pref[N];
ll ans;
ll get(int l, int r) {
return pref[r] - pref[l - 1];
}
bool check1(ll x) {
for (int i = 1; i <= n; i++) {
dp[i] = inf;
for (int j = i; j >= 1; j--) {
if ((x | get(j, i)) == x) {
dp[i] = min(dp[i], dp[j - 1] + 1);
}
}
}
return dp[n] <= b;
}
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];
}
if (a == 1) {
for (int i = 40; i >= 0; i--) {
if (!check1(ans + (1LL << i) - 1)) {
ans += (1LL << i);
}
}
} else {
}
printf("%lld", ans);
}
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... |