# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31085 | WhipppedCream | Bali Sculptures (APIO15_sculpture) | C++14 | 116 ms | 2044 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 X first
#define Y second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector< ii > vii;
typedef long long LL;
LL qs[2005];
LL ask(int a, int b)
{
return qs[b]-qs[a-1];
}
int dp[2005];
int n, a, b;
int f(int u, LL targ)
{
if(u == n+1) return 0;
if(dp[u] != -1) return dp[u];
dp[u] = 1e9;
for(int i = u; i<= n; i++)
{
LL w = ask(u, i);
if((targ|w)> targ) continue;
dp[u] = min(dp[u], 1+f(i+1, targ));
}
return dp[u];
}
bool works(LL trie)
{
memset(dp, -1, sizeof dp);
int ans = f(1, trie);
if(ans<= b) return 1;
return 0;
}
int main()
{
scanf("%d %d %d", &n, &a, &b);
for(int i = 1; i<= n; i++)
{
scanf("%lld", qs+i);
qs[i] += qs[i-1];
}
LL cur = (1LL<<41)-1;
for(int i = 40; i>= 0; i--)
{
LL want = cur-(1LL<<i);
if(works(want)) cur = want;
}
printf("%lld\n", cur);
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... |