| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 668311 | finn__ | Gap (APIO16_gap) | C++17 | 60 ms | 1088 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 <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int T, int n)
{
switch (T)
{
case 1:
{
long long a, b, x, y, max_d = 0;
MinMax(0, 1e18, &a, &b);
size_t num_examined = 2;
if (num_examined == n)
max_d = max(max_d, b - a);
while (num_examined < n)
{
if (num_examined == n - 1)
{
MinMax(a + 1, b, &x, &y);
num_examined++;
}
else
{
MinMax(a + 1, b - 1, &x, &y);
num_examined += 2;
}
max_d = max(max_d, max(x - a, b - y));
a = x;
b = y;
if (num_examined == n)
max_d = max(max_d, y - x);
}
return max_d;
}
case 2:
{
long long a, b;
MinMax(0, 1e18, &a, &b);
long long const l = (b - a) / (n - 1) + 2, x0 = a;
long long last = a, max_d = 0;
for (size_t i = 0; i < n - 1; i++)
{
MinMax(x0 + i * l + 1, x0 + (i + 1) * l, &a, &b);
max_d = max(max_d, a - last);
last = b;
}
return max_d;
}
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
