# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32178 | minchurl | Bali Sculptures (APIO15_sculpture) | C++11 | 749 ms | 5068 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<stdio.h>
#define LL long long
#define MAX_N 2005
#define inf (1LL<<60)
#define MIN(x,y) ((x)<(y)?(x):(y))
LL ans,e;
LL arr[MAX_N],t[MAX_N];
bool sp_t[MAX_N][MAX_N];
LL N,A,B;
bool sp=false;
bool sp_is_ok(LL x){
LL i,j,k,sum,y,z;
LL end_point;
for(i=0;i<=N;i++){
for(j=0;j<=i;j++) sp_t[i][j]=false;
}
sp_t[0][0]=true;
if(x>=0) ans+=(1LL<<x);
y=(ans&-ans);
for(i=1;i<=N;i++){
sum=0;
for(j=i;j>=1;j--){
sum+=arr[j];
z=sum;
if(x>=0){z=sum|(y-1);z++;z-=y;}
z|=ans;
if(z!=ans) continue;
end_point=MIN(j,B);
for(k=0;k<end_point;k++){
if(sp_t[j-1][k]==true) sp_t[i][k+1]=true;
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... |