# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42102 | minchurl | Bali Sculptures (APIO15_sculpture) | C++11 | 249 ms | 876 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 MAX_N 2005
#define inf (1LL<<62)
#define LL long long
using namespace std;
LL n,a,b,ans,arr[MAX_N];
LL t[MAX_N];
bool ct[MAX_N][MAX_N];
bool case1(LL x){
LL i,j,sum,test,y,z,k,l;
bool p=false;
y=inf-1;y-=(1LL<<x)-1;
z=ans&y;
for(i=0;i<=n;i++) for(j=0;j<=n;j++) ct[i][j]=false;
ct[0][0]=true;
for(l=1;l<=b;l++){
for(i=1;i<=n;i++){
sum=0;
for(j=i;j>=1;j--){
sum+=arr[j];
k=sum&y;
if((z|k)==z) ct[l][i]|=ct[l-1][j-1];
}
if(l>=a) p|=ct[l][n];
}
}
return p;
}
bool is_ok(LL x){
LL i,j,sum,test,y,z,k;
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... |