| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 953926 | 4QT0R | Gap (APIO16_gap) | C++17 | 0 ms | 0 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>
#include "gap.h"
using namespace std;
#define ll long long
ll findGap(ll T, ll n){
ll L,P;
MinMax(0,1e18,&L,&P);
ll d=(P-L)/(n-1);
ll ans=d,x,y;
while(P-L>d){
MinMax(L+1,P-1,&x,&y);
if (x==-1)ans=max(ans,P-L);
else{
ans=max({ans,x-L,P-y});
L=x;
P=y;
}
}
return ans;
}