# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100111 | TadijaSebez | Bali Sculptures (APIO15_sculpture) | C++11 | 201 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
const int N=2050;
const int M=205;
int a[N];
bitset<M> dp[M];
ll sum[N];
ll mn[N];
int main()
{
int n,A,B;
scanf("%i %i %i",&n,&A,&B);
for(int i=1;i<=n;i++) scanf("%i",&a[i]),sum[i]=sum[i-1]+a[i];
ll ans=0;
for(int l=50;~l;l--)
{
if(A!=1)
{
for(int i=0;i<=n;i++) dp[i]=0;
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=i-1;j>=0;j--)
{
ll val=sum[i]-sum[j];
if(((val>>(l+1))|ans)==ans && !((val>>l)&1))
{
dp[i]|=dp[j]<<1;
}
}
}
bool ok=0;
for(int i=A;i<=B;i++) ok|=dp[n][i];
ans*=2;
if(!ok) ans++;
}
else
{
for(int i=0;i<=n;i++) mn[i]=N;
mn[0]=0;
for(int i=1;i<=n;i++)
{
for(int j=i-1;j>=0;j--)
{
ll val=sum[i]-sum[j];
if(((val>>(l+1))|ans)==ans && !((val>>l)&1))
{
mn[i]=min(mn[i],mn[j]+1);
}
}
}
ans*=2;
if(mn[n]>B) ans++;
}
}
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... |