# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775515 | anaduguleanu | Gap (APIO16_gap) | C++14 | 70 ms | 5832 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 <iostream>
#include <set>
#include "gap.h"
#define INF 1000000000000000000
using namespace std;
set <long long> s;
long long findGap(int T, int N)
{
if (T == 1)
{
long long minimum, maximum;
MinMax(1, INF, &minimum, &maximum);
s.insert(minimum);
s.insert(maximum);
for (int i = 1; i < (N + 1) >> 1; i++)
{
long long val1, val2;
MinMax(minimum + 1, maximum - 1, &val1, &val2);
s.insert(val1);
s.insert(val2);
minimum = val1;
maximum = val2;
}
long long maxGap = 0, last = minimum;
for (auto it : s)
{
maxGap = max(maxGap, it - last);
last = it;
}
return maxGap;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |