# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698135 | ToroTN | Bali Sculptures (APIO15_sculpture) | C++14 | 1 ms | 384 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
ll n,a,b,arr[2005],dp[105][105],val[105][105],ans;
int main()
{
scanf("%lld%lld%lld",&n,&a,&b);
for(int i=1;i<=n;i++)
{
scanf("%lld",&arr[i]);
}
if(n<=100)
{
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
val[i][j]=0;
for(int k=i;k<=j;k++)
{
val[i][j]+=arr[k];
}
//printf("%lld %lld %lld\n",i,j,val[i][j]);
}
}
for(int i=0;i<=100;i++)for(int j=0;j<=100;j++)dp[i][j]=1e18;
dp[0][0]=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
for(int k=0;k<i;k++)
{
dp[i][j]=min(dp[i][j],(dp[k][j-1]|val[k+1][i]));
}
//printf("%d %d %lld\n",i,j,dp[i][j]);
}
}
ans=1e9;
for(int i=a;i<=b;i++)ans=min(ans,dp[n][i]);
printf("%lld\n",ans);
}else
{
}
}
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... |