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<iostream>
using namespace std;
typedef long long int llint;
llint findGap(int T, int N)
{
llint mn,mx;
/*cout << 1 << " " << 1e18 << "\n";
cin >> mn >> mx;*/
MinMax(1,(llint)1e18,&mn,&mx);
llint x=mn,y=mx,rr=mx-mn,r=(mx-mn)/(N-1)+((mx-mn)%(N-1)!=0);
while(x!=y) {
/*cout << x << " " << x+r << "\n";
cin >> mn >> mx;*/
MinMax(x,x+r,&mn,&mx);
if(mn!=mx) {
x=mx;
continue;
}
llint lo=r,hi=rr;
while(lo<hi) {
int mid=(lo+hi)/2;
/*cout << x << " " << x+mid << "\n";
cin >> mn >> mx;*/
MinMax(x,x+mid,&mn,&mx);
if(mx!=mn) hi=mid;
else lo=mid+1;
}
r=lo;
x+=r;
}
return r;
}
/*int main()
{
cout << findGap(1,5);
return 0;
}*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |