# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127606 | mahmoudbadawy | Bali Sculptures (APIO15_sculpture) | C++17 | 152 ms | 760 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;
const int N=2005;
long long arr[N];
long long mem1[N/10][N/10],sum[N];
long long mem2[N];
int n,a,b;
long long cans;
long long go(int ind,int gr)
{
if(ind>=n&&a<=gr&&gr<=b)
return 1;
if(ind>=n||gr>b)
return 0;
if(mem1[ind][gr]!=-1)
return mem1[ind][gr];
mem1[ind][gr]=0;
for(int i=ind;i<n;i++)
{
long long sm=sum[i]-(ind?sum[ind-1]:0);
if((sm&cans) > 0) continue;
mem1[ind][gr]|=go(i+1,gr+1);
}
return mem1[ind][gr];
}
# | 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... |