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;
typedef long long ll;
#define int ll
const int MAX = 1e18;
int findGap(signed T, signed N) {
int l = 0;
int r = MAX;
MinMax(l, r, &l, &r);
int ans = 0;
while (r != l) {
int nr;
MinMax(l, r - 1, &l, &nr);
ans = max(ans, r - nr);
r = nr;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |