# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41697 | Hassoony | Bali Sculptures (APIO15_sculpture) | C++14 | 172 ms | 1152 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 double D;
const ll inf=(1ll<<61);
const int MX=2009;
ll n,A,B;
ll a[MX],dp[MX],ans,sum1,dp1[109][109];
ll DP(ll x){
if(x==n)return 0;
ll &ret=dp[x];if(ret!=-1)return ret;
ret=inf;
ll sum=0;
for(int i=x;i<n;i++){
sum+=a[i];
if((sum&sum1)==0){
ret=min(ret,DP(i+1)+1);
}
}
return ret;
}
ll DP1(ll x,ll y){
if(y>B)return 0;
if(x==n)return (y>=A);
ll &ret=dp1[x][y];if(ret!=-1)return ret;
ret=0;
ll sum=0;
for(int i=x;i<n;i++){
sum+=a[i];
if((sum&sum1)==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... |