# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110368 | Vardanyan | Gap (APIO16_gap) | C++14 | 1429 ms | 1272 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 "gap.h"
#include <algorithm>
using namespace std;
long long findGap(int T, int N)
{
long long s = 0;
long long t = 100000000000000000;
long long nax;
long long as = 0;
for(int i = 0;i<N;i++){
long long l = s;
long long r = t;
long long ans;
while(l<=r){
long long mid = (l+r)/2;
long long mn,mx;
MinMax(l,mid,&mn,&mx);
if(mn!=-1 && mx!=-1){
r = mid-1;
ans = mid;
if(mn == mx){
ans = mn;
break;
}
}
else{
l = mid+1;
}
}
if(i){
as = max(as,ans-nax);
}
nax = ans;
s = ans+1;
}
// cout<<as<<endl;
return as;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |