# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72710 | Pajaraja | Bali Sculptures (APIO15_sculpture) | C++17 | 628 ms | 31720 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 MAXN 2007
using namespace std;
long long s[MAXN][MAXN],arr[MAXN];
bool g[MAXN][MAXN],ag[MAXN][MAXN],dp[MAXN][MAXN];
int dpl[MAXN];
int main()
{
int n,a,b;
scanf("%d%d%d",&n,&a,&b);
for(int i=0;i<n;i++) scanf("%lld",&arr[i]);
for(int i=0;i<n;i++) s[i][i]=arr[i];
for(int i=0;i<n;i++) for(int j=i+1;j<=n;j++) {ag[i][j]=true; s[i][j]=s[i][j-1]+arr[j];}
long long rez=0;
for(int x=40;x>=0;x--)
{
for(int i=0;i<n;i++) for(int j=i+1;j<=n;j++) g[i][j]=(((1LL<<x)|s[i][j-1])!=s[i][j-1]) && ag[i][j];
bool ra=false;
if(n<=200)
{
for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) dp[i][j]=false;
dp[0][0]=true;
for(int i=0;i<n;i++) for(int j=i+1;j<=n;j++) if(g[i][j]) for(int r=1;r<=n;r++) dp[j][r]=dp[j][r]||dp[i][r-1];
for(int i=a;i<=b;i++) if(dp[n][i]) ra=true;
}
else
{
for(int i=1;i<=n;i++) dpl[i]=MAXN;
dpl[0]=0;
for(int i=0;i<n;i++) for(int j=i+1;j<=n;j++) if(g[i][j]) dpl[j]=min(dpl[j],dpl[i]+1);
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... |