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 findGap(int T, int N)
{
long long ans = 0;
if(T == 1)
{
long long mx, my;
vector<long long> vt = {};
long long l = 0;
long long r = 1e18;
while(true)
{
MinMax(l, r, &mx, &my);
if(mx == my)
{
vt.push_back(mx);
break;
}
if(mx == -1)
{
break;
}
vt.push_back(mx);
vt.push_back(my);
l = mx + 1;
r = my - 1;
}
sort(vt.begin(), vt.end());
for(int i = 1; i < N; i++)
{
ans = max(ans, vt[i] - vt[i - 1]);
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |