# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146451 | arnold518 | Bali Sculptures (APIO15_sculpture) | C++14 | 361 ms | 32120 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2000;
int N, A, B;
ll Y[MAXN+10], ans=0, dp1[MAXN+10], dp2[MAXN+10][MAXN+10];
int main()
{
int i, j, k, p;
scanf("%d%d%d", &N, &A, &B);
for(i=1; i<=N; i++) scanf("%lld", &Y[i]), Y[i]+=Y[i-1];
ans=(1ll<<46)-1;
if(A==1)
{
for(i=45; i>=0; i--)
{
ll now=1ll<<i;
ans^=now;
for(j=1; j<=N; j++) dp1[j]=987654321; dp1[0]=0;
for(j=1; j<=N; j++) for(k=0; k<j; k++) if((ans|(Y[j]-Y[k]))==ans) dp1[j]=min(dp1[j], dp1[k]+1);
if(dp1[N]>B) ans|=now;
}
}
else
{
for(i=45; i>=0; i--)
{
ll now=1ll<<i;
ans^=now;
memset(dp2, 0, sizeof(dp2)); dp2[0][0]=1;
for(j=1; j<=N; j++) for(k=1; k<=N; k++) for(p=0; p<j; p++) if((ans|(Y[j]-Y[p]))==ans) dp2[j][k]|=dp2[p][k-1];
bool flag=false;
for(j=A; j<=B; j++) flag|=dp2[N][j];
if(!flag) ans|=now;
}
}
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... |