# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1007649 | amin_2008 | Gap (APIO16_gap) | C++17 | 38 ms | 4048 KiB |
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 "vector"
#include "algorithm"
using namespace std;
long long findGap(int T, int N)
{
long long mn = 0, mx = 1e18;
vector<long long> v;
for(int i = 1; i <= (N + 1) / 2; i++)
{
MinMax(mn, mx, &mn, &mx);
v.push_back(mn);
if (mn != mx) v.push_back(mx);
mn++, mx--;
}
sort(v.begin(), v.end());
long long res = 0;
for(int i = 1; i < v.size(); i++) res = max(res, v[i] - v[i - 1]);
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |