# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
270477 | BeanZ | Bali Sculptures (APIO15_sculpture) | C++14 | 537 ms | 512 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 ll long long
#define endl '\n'
const int N = 3e6 + 5;
ll dp[2005], f[2005], a[2005], sum[2005];
ll ans = 0;
bool chk(ll now, ll s){
for (int i = 41; i >= s; i--){
if ((ans & (1ll << i)) == 0){
if (now & (1ll << i)){
return false;
}
}
}
return true;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("VietCT.INP", "r")){
freopen("VietCT.INP", "r", stdin);
freopen("VietCT.OUT", "w", stdout);
}
ll n, L, R;
cin >> n >> L >> R;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
for (int s = 41; s >= 0; s--){
for (int i = 1; i <= n; i++){
f[i] = dp[i];
}
for (int i = 1; i <= n; i++){
if (f[i] == -1) continue;
f[i] = 1e9;
for (int j = 0; j < i; j++){
if (f[j] == -1) continue;
ll cost = sum[i] - sum[j];
if (chk(cost, s)){
f[i] = min(f[i], f[j] + 1);
}
}
if (f[i] == 1e9) f[i] = -1;
//cout << f[i] << " ";
}
//cout << endl;
if (f[n] <= R && f[n] != -1){
for (int i = 1; i <= n; i++){
if (f[i] <= R) dp[i] = f[i];
else dp[i] = -1;
}
} else {
ans = ans + (1ll << s);
}
}
cout << ans;
}
/*
6 1 3
8 1 2 1 5 4
*/
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... |