# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76821 | vex | Bali Sculptures (APIO15_sculpture) | C++14 | 364 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 maxn 2005
using namespace std;
int n,a,b;
long long s[maxn];
bool moze(int x)
{
int g=0;
int pr=0;
long long tr=1LL<<x;
for(int i=1;i<=n;i++)
{
if(s[i]-s[pr]>=tr)
{
if(i==pr+1)return false;
g++;
pr=i-1;
i--;
}
else if(i==n)g++;
}
if(g<=b)return true;
return false;
}
int numbit()
{
int l=0;
int r=50;
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... |