# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135182 | emre | Bali Sculptures (APIO15_sculpture) | C++17 | 173 ms | 676 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 ll long long
#define N 2005
using namespace std;
int n,a,b;
bool dpr[N][N];
int ar[N];
int dpm[N];
ll pre[N];
bool eval(ll sum,int bit,ll value) {
ll ssum=sum>>bit;
ll sval=value>>bit;
return (ssum|sval)==sval;
}
bool get_solution_min(int bit,ll value) {
for(int ind=1;ind<=n;ind++) {
dpm[ind]=n+1;
for(int indp=1;indp<=ind;indp++) {
if(eval(pre[ind]-pre[indp-1],bit,value)) dpm[ind]=min(dpm[ind],dpm[indp-1]+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... |