# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104799 | ekrem | Bali Sculptures (APIO15_sculpture) | C++98 | 209 ms | 632 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 1000000007
#define N 1000005
using namespace std;
typedef long long ll;
ll n, X, y, ans, a[N], dp[N], dpp[105][105], pre[N];
bool bak(ll x){
for(int i = 1; i <= n; i++)
dp[i] = inf;
for(int i = 0; i < 105; i++)
for(int j = 0; j < 105; j++)
dpp[i][j] = 0;
dpp[0][0] = 1;
for(int i = 1; i <= n; i++)
for(int j = 0; j < n; j++){
ll su = pre[i] - pre[j];
if(su - (x&su) == 0 ){
if(n <= 100){
for(int k = 1; k < 105; k++)
dpp[i][k] |= dpp[j][k - 1];
}
dp[i] = min(dp[i], dp[j] + 1);
}
}
if(n <= 100){
for(int i = X; i <= y; i++){
// cout << "AMK" << x << " " << i << " " << dpp[n][i] << endl;
if(dpp[n][i])
return 1;
}
return 0;
}
// cout << x << " " << dpp[n] << endl;
return dp[n] <= y;
}
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];
}
ans = (1ll<<45) - 1;
for(int i = 44; i >= 0; i--){
if(bak(ans - (1ll<<i))){
// cout << ans << " " << i << endl;
ans -= (1ll<<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... |