| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 111558 | aleksam | Gap (APIO16_gap) | C++14 | 63 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 <bits/stdc++.h>
#define LLMAX 1000000000000000000LL
long long findGap(int T, int N)
{
long long apsmin, apsmax;
long long g=1, gg=1;
while(1){
long long mn, mx;
MinMax(1, g+1, &mn, &mx);
if(mn!=-1){
apsmin=mn;
break;
}
g*=10;
}
long long last=apsmin;
while(1){
long long mn, mx;
bool kraj=false;
if(last+g<LLMAX)
MinMax(last+1, last+g, &mn, &mx);
else {
MinMax(last+1, LLMAX, &mn,&mx);
kraj=true;
}
if(mn==-1){
g=2*g+1;
if(!kraj)
continue;
else break;
}
if(mn-last>gg){
gg=mn-last;
g=gg;
}
last=mx;
if(kraj)break;
}
return gg;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
