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>
#define ll long long
#define pii pair<int, int>
using namespace std;
const ll MAX = 1000000000000000000ll;
ll findGap(int T, int N)
{
ll mn, mx;
MinMax(0, MAX, &mn, &mx);
ll ans = 1;
ll p = mn;
while(p != mx){
ll l = 0, h = 0;
ll dist = ans;
while(true){
MinMax(p + 1, p + dist, &l, &h);
if(l == -1){
dist *= 2;
continue;
}
ans = max(ans, l - p);
p = h;
break;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |