# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014292 | aufan | Gap (APIO16_gap) | C++17 | 55 ms | 3596 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 <bits/stdc++.h>
using namespace std;
const long long inff = 1e18;
long long findGap(int t, int n) {
if (t == 1) {
long long l = 0, r = inff;
vector<long long> a(n);
for (int i = 0; i < (n + 1) / 2; i++) {
long long mn, mx;
MinMax(l, r, &mn, &mx);
a[i] = mn;
a[n - 1 - i] = mx;
l = mn + 1;
r = mx - 1;
}
long long res = 0;
for (int i = 0; i < n - 1; i++) res = max(res, a[i + 1] - a[i]);
return res;
} else if (t == 2) {
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |