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;
long long solve(long long l, long long r) {
if (l == r) {
return 0;
}
long long mid = (l + r) / 2;
long long t, smaller, bigger;
MinMax(l, mid, &t, &smaller);
MinMax(mid, r, &bigger, &t);
if (smaller == bigger) {
return 0;
}
return max({bigger - smaller, solve(l, smaller), solve(bigger, r)});
}
long long findGap(int T, int N) {
long long mn, mx;
MinMax(0, LLONG_MAX, &mn, &mx);
return solve(mn, mx);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |