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>
using namespace std;
#define int long long
int dnc(int l, int r){
if (l==r) return 0;
int mid=(l+r)>>1;
int l1, r1, l2, r2;
MinMax(l, mid, &l1, &r1);
MinMax(mid+1, r, &l2, &r2);
return max({l2-r1, dnc(l1, r1), dnc(l2, r2)});
}
long long findGap(int32_t T, int32_t N)
{
int l, r;
MinMax(0, 1e18, &l, &r);
return dnc(l, r);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |